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
Reports

Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations

Olivier Devillers 1 Monique Teillaud 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Though Delaunay and regular triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional triangulation is actually 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 (www.cgal.org).
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00090522
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, September 4, 2006 - 11:58:27 AM
Last modification on : Friday, February 4, 2022 - 3:16:00 AM
Long-term archiving on: : Monday, September 20, 2010 - 4:52:08 PM

Identifiers

  • HAL Id : inria-00090522, version 2

Collections

Citation

Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations. [Research Report] RR-5968, INRIA. 2006, pp.11. ⟨inria-00090522v2⟩

Share

Metrics

Record views

236

Files downloads

172