Sciweavers

Share
ICCSA
2005
Springer

Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization

12 years 1 days ago
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.
Hugo Ledoux, Christopher M. Gold, George Baciu
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICCSA
Authors Hugo Ledoux, Christopher M. Gold, George Baciu
Comments (0)
books