Abstract : Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still a problem in practice. We propose a simple method that allows to remove any vertex even when the points are in very degenerate configurations. The solution is available in CGAL (http://www.cgal.org, releases 2.3 and 2.4).
Type de document :
Communication dans un congrès
14th ACM-Siam Symposium on Discrete Algorithms (SODA), 2003, Baltimore, MA, United States. pp.313--319, 2003
https://hal.inria.fr/inria-00166710
Contributeur : Olivier Devillers
<>
Soumis le : vendredi 21 décembre 2012 - 14:45:30
Dernière modification le : samedi 27 janvier 2018 - 01:30:58
Document(s) archivé(s) le : dimanche 18 décembre 2016 - 08:31:42
Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. 14th ACM-Siam Symposium on Discrete Algorithms (SODA), 2003, Baltimore, MA, United States. pp.313--319, 2003. 〈inria-00166710v2〉
