Sciweavers

Share
SODA
2003
ACM

Perturbations and vertex removal in a 3D delaunay triangulation

9 years 2 months ago
Perturbations and vertex removal in a 3D delaunay triangulation
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 cgal1 .
Olivier Devillers, Monique Teillaud
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Olivier Devillers, Monique Teillaud
Comments (0)
books