Incremental construction of the Delaunay graph in medium dimension - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Incremental construction of the Delaunay graph in medium dimension

Jean-Daniel Boissonnat
  • Function : Author
  • PersonId : 830857
Olivier Devillers
Samuel Hornus


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.
Fichier principal
Vignette du fichier
socg09.pdf (418.13 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00412437 , version 1 (01-09-2009)



Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus. Incremental construction of the Delaunay graph in medium dimension. Proceedings of the 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, ⟨10.1145/1542362.1542403⟩. ⟨inria-00412437⟩
2298 View
691 Download



Gmail Mastodon Facebook X LinkedIn More