Flipping to robustly delete a vertex in a Delaunay tetrahedralization

Hugo Ledoux; Christopher M. Gold; George Baciu

Flipping to robustly delete a vertex in a Delaunay tetrahedralization

Hugo Ledoux, Christopher M. Gold, George Baciu

Research output: Journal article publication › Conference article › Academic research › peer-review

Abstract

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 language	English
Pages (from-to)	737-747
Number of pages	11
Journal	Lecture Notes in Computer Science
Volume	3480
Issue number	I
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)

Cite this

@article{f7f98885f0af4421911509587acde3cb,

title = "Flipping to robustly delete a vertex in a Delaunay tetrahedralization",

abstract = "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.",

author = "Hugo Ledoux and Gold, {Christopher M.} and George Baciu",

year = "2005",

month = sep,

day = "26",

language = "English",

volume = "3480",

pages = "737--747",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

number = "I",

note = "International Conference on Computational Science and Its Applications - ICCSA 2005 ; Conference date: 09-05-2005 Through 12-05-2005",

}

TY - JOUR

T1 - Flipping to robustly delete a vertex in a Delaunay tetrahedralization

AU - Ledoux, Hugo

AU - Gold, Christopher M.

AU - Baciu, George

PY - 2005/9/26

Y1 - 2005/9/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24944443434&partnerID=8YFLogxK

M3 - Conference article

SN - 0302-9743

VL - 3480

SP - 737

EP - 747

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

IS - I

T2 - International Conference on Computational Science and Its Applications - ICCSA 2005

Y2 - 9 May 2005 through 12 May 2005

ER -

Flipping to robustly delete a vertex in a Delaunay tetrahedralization

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this