Why is the 3D Delaunay Triangulation Difficult to Construct

[1]  Victor J. Milenkovic,et al.  Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic , 1989, Artif. Intell..

[2]  Lee R. Nackman,et al.  Efficient Delaunay triangulation using rational arithmetic , 1991, TOGS.

[3]  M. Iri,et al.  Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic , 1992, Proc. IEEE.

[4]  Kazuo Murota,et al.  IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS , 1984 .

[5]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[6]  Christoph M. Hoffmann,et al.  The problems of accuracy and robustness in geometric computation , 1989, Computer.

[7]  Herbert Edelsbrunner,et al.  An acyclicity theorem for cell complexes ind dimension , 1990, Comb..

[8]  Herbert Edelsbrunner,et al.  An acyclicity theorem for cell complexes in d dimensions , 1989, SCG '89.

[9]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[10]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[11]  Peter Schorn.  Robust algorithms in a program library for geometric computation , 1991, Informatik-Dissertationen ETH Zürich.

[12]  Chee-Keng Yap.  Geometric Consistency Theorem for a Symbolic Perturbation Scheme , 1990, J. Comput. Syst. Sci..

[13]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[14]  Kokichi Sugihara,et al.  A solid modelling system free from topological inconsistency , 1990 .

[15]  Donald E. Knuth,et al.  Axioms and Hulls , 1992, Lecture Notes in Computer Science.

[16]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[17]  John F. Canny,et al.  An efficient approach to removing geometric degeneracies , 1992, SCG '92.

[18]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[19]  Steven Fortune,et al.  Stable maintenance of point set triangulations in two dimensions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Kokichi Sugihara,et al.  A robust Topology-Oriented Incremental algorithm for Voronoi diagrams , 1994, Int. J. Comput. Geom. Appl..