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).
https://hal.inria.fr/inria-00166710
Contributor : Olivier Devillers
<>
Submitted on : Friday, December 21, 2012 - 2:45:30 PM
Last modification on : Wednesday, October 30, 2019 - 7:36:17 PM
Long-term archiving on : Sunday, December 18, 2016 - 8:31:42 AM
Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MA, United States. pp.313--319. ⟨inria-00166710v2⟩
