Perturbations and Vertex Removal in a 3D Delaunay Triangulation - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Perturbations and Vertex Removal in a 3D Delaunay Triangulation

(1) , (1)
1
Olivier Devillers
Monique Teillaud

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).
Fichier principal
Vignette du fichier
soda.pdf (285.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00166710 , version 1 (08-08-2007)
inria-00166710 , version 2 (21-12-2012)

Identifiers

  • HAL Id : inria-00166710 , version 2

Cite

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⟩

Collections

INRIA INRIA2
286 View
947 Download

Share

Gmail Facebook Twitter LinkedIn More