Flipping to robustly delete a vertex in a Delaunay tetrahedralization

Hugo Ledoux, Christopher M. Gold, George Baciu

Research output: Journal article publicationConference articleAcademic researchpeer-review

13 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)737-747
Number of pages11
JournalLecture Notes in Computer Science
Issue numberI
Publication statusPublished - 26 Sept 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 9 May 200512 May 2005

ASJC Scopus subject areas

  • Computer Science (miscellaneous)


Dive into the research topics of 'Flipping to robustly delete a vertex in a Delaunay tetrahedralization'. Together they form a unique fingerprint.

Cite this