inria-00166710, version 1
Perturbations and Vertex Removal in a 3D Delaunay Triangulation
Olivier Devillers
a, 1Monique Teillaud a, 1
14th ACM-Siam Symp. on Algorithms (SODA) (2003) 313--319
Résumé : 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).
- a – INRIA
- 1 : GEOMETRICA (INRIA Sophia Antipolis)
- INRIA
- Domaine : Informatique/Géométrie algorithmique
- inria-00166710, version 1
- http://hal.inria.fr/inria-00166710
- oai:hal.inria.fr:inria-00166710
- Contributeur : Olivier Devillers
- Soumis le : Mercredi 8 Août 2007, 18:47:53
- Dernière modification le : Mercredi 8 Août 2007, 22:12:30
Documents associés
Exporter