Abstract
The paper presents a general method for the design of numerically robust and topologically consistent geometric algorithms concerning convex polyhedra in the three-dimensional space. A graph is the vertex-edge graph of a convex polyhedron if and only if it is planar and triply connected (Steinitz' theorem). On the basis of this theorem, conventional geometric algorithms are revised in such a way that, no matter how poor the precision in numerical computation may be, the output graph is at least planar and triply connected. The resultant algorithms are robust in the sense that they do not fail in finiteprecision arithmetic, and are consistent in the sense that the output is the true solution to a perturbed input.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. Aurenhammer: Power diagrams — Properties, algorithms and applications. SIAM Journal on Computing, Vol. 16 (1987), pp. 78–96.
K. Q. Brown: Voronoi diagrams from convex hulls. Information Processing Letters, Vol. 9 (1979), pp. 223–228.
M. B. Dillencourt: Toughness and Delaunay triangulations. Discrete and Computational Geometry, Vol. 5 (1990), pp. 575–601.
L. Guibas, D. Salesin and J. Stolfi: Epsilon geometry — Building robust algorithms from imprecise computations. Proceedings of the 5th ACM Annual Symposium on Computational Geometry, Saarbrücken, 1989, pp. 208–217.
C. M. Hoffmann: The problems of accuracy and robustness in geometric computation. IEEE Computer, Vol. 22, No. 3 (March 1989), pp. 31–41.
J. E. Hopcroft and P. J. Kahn: A paradigm for robust geometric algorithms. Technical Report, TR89-1044, Department of Computer Science, Cornell University, Ithaca, 1989.
V. Milenkovic: Verifiable implementations of geometric algorithms using finite precision arithmetic. Artificial Intelligence, Vol. 37 (December 1988), pp. 377–401.
T. Ottmann, G. Thiemt and C. Ullrich: Numerical stability of geometric algorithms. Proceedings of the 3rd ACM Annual Conference on Computational Geometry, Waterloo, pp. 119–125, 1987.
E. Steinitz: Polyeder und Raumeinteilungen. EncyklopÄdie der mathematischen Wissenschaften, Band III, Teil 1, 2. HÄlfte, IIIAB12, pp. 1–139, 1916.
K. Sugihara and M. Iri: Two design principles of geometric algorithms in finiteprecision arithmetic. Applied Mathematics Letters, Vol. 2 (1989), pp. 203–206.
K. Sugihara and M. Iri: A solid modelling system free from topological inconsistency. Journal of Information Processing, Vol. 12 (1989), pp. 380–393.
K. Sugihara and M. Iri: Construction of the Voronoi diagram for “one million” generators in single-precision arithmetic. Proceedings of the IEEE (to appear).
H. Whitney: Congruent graphs and the connectivity of graphs. American Journal of Mathematics, Vol. 54 (1932), pp. 150–168.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sugihara, K. (1992). Topologically consistent algorithms related to convex polyhedra. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_74
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive