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.
|Number of pages||11|
|Journal||Lecture Notes in Computer Science|
|Publication status||Published - 26 Sept 2005|
|Event||International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore|
Duration: 9 May 2005 → 12 May 2005
ASJC Scopus subject areas
- Computer Science (miscellaneous)