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 metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00090522
Contributor : Rapport de Recherche Inria <>
Submitted on : Monday, September 4, 2006 - 11:58:27 AM
Last modification on : Wednesday, October 30, 2019 - 7:36:17 PM
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

395

Files downloads

321