Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization

We discuss the deletion of a single vertex in a Delaunay tetrahedralization (DT). While some theoretical solutions exist for this problem, the many degeneracies in three dimensions make them impossible to be implemented without the use of extra mechanisms. In this paper, we present an algorithm that uses a sequence of bistellar flips to delete a vertex in a DT, and we present two different mechanisms to ensure its robustness.

• Type: Conference
• Year: 2005
• Where: ICCSA
• Authors: Hugo Ledoux, Christopher M. Gold, George Baciu
• Keywords: Applied Computing, Delaunay Tetrahedralization, ICCSA 2005, Single Vertex, Theoretical Solutions