Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension

We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is fully robust. Extensive comparisons show that our implementation outperforms the best currently available codes for exact convex hulls and Delaunay triangulations, compares very well to the fast non-exact Qhull implementation and can be used for quite big input sets in spaces of dimensions up to 6. To circumvent prohibitive memory usage, we also propose a modification of the algorithm that uses and stores only the Delaunay graph (the edges of the full triangulation). We show that a careful implementation of the modified algorithm performs only 6 to 8 times slower than the original algorithm while drastically reducing memory usage in dimension 4 or above. Categories and Subject Descriptors D.2.8 [Software Engineering]: Metrics—Performance measures; F.2.2 [Analysis of Algorithms and Problem ...

• Type: Conference
• Year: 2009
• Where: COMPGEOM
• Authors: Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus
• Keywords: Algorithms, COMPGEOM 2009, Delaunay Graph, Delaunay Triangulation, Discrete Geometry