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 .

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: Olivier Devillers, Monique Teillaud
• Keywords: Algorithms, Delaunay Triangulation, Robust Removal, SODA 2003, Three-dimensional Delaunay Triangulation