Incremental construction of the Delaunay graph in medium dimension

Jean-Daniel Boissonnat 1 Olivier Devillers 1 Samuel Hornus 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : 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.
Type de document :
Communication dans un congrès
Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, 2009
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00412437
Contributeur : Olivier Devillers <>
Soumis le : mardi 1 septembre 2009 - 16:11:46
Dernière modification le : samedi 27 janvier 2018 - 01:31:32
Document(s) archivé(s) le : mardi 16 octobre 2012 - 10:10:35

Fichier

socg09.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00412437, version 1

Collections

Citation

Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus. Incremental construction of the Delaunay graph in medium dimension. Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, 2009. 〈inria-00412437〉

Partager

Métriques

Consultations de la notice

2034

Téléchargements de fichiers

320