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

Perturbations and Vertex Removal in a 3D Delaunay Triangulation

Olivier Devillers 1 Monique Teillaud 2
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis (... - 2019), CNRS - Centre National de la Recherche Scientifique : UMR6621
2 PRISME - Geometry, Algorithms and Robotics
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\footnote{\texttt- {http://www.cgal.org} (releases 2.3 and 2.4)}.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:22:11 PM
Last modification on : Friday, February 4, 2022 - 3:19:29 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:46:27 PM


  • HAL Id : inria-00071961, version 1


Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. RR-4624, INRIA. 2002. ⟨inria-00071961⟩



Record views


Files downloads