HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Perturbations and Vertex Removal in a 3D Delaunay Triangulation

Olivier Devillers 1 Monique Teillaud 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
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).
Document type :
Conference papers
Complete list of metadata

Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Wednesday, August 8, 2007 - 6:47:53 PM
Last modification on : Wednesday, October 30, 2019 - 7:36:17 PM
Long-term archiving on: : Friday, April 9, 2010 - 12:31:32 AM


Files produced by the author(s)


  • HAL Id : inria-00166710, version 1


Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. 14th ACM-Siam Symp. on Algorithms (SODA), 2003, Baltimore, MA, United States. pp.313--319. ⟨inria-00166710v1⟩



Record views


Files downloads