Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/64336
Title: Flipping to robustly delete a vertex in a delaunay tetrahedralization
Authors: Ledoux, H
Gold, CM
Baciu, G 
Issue Date: 2005
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), v. 3480, p. 737-747 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
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.
Description: International Conference on Computational Science and Its Applications (ICCSA 2005), Singapore, May 9-12, 2005
URI: http://hdl.handle.net/10397/64336
ISBN: 978-3-540-25860-5 (print)
978-3-540-32043-2 (online)
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/11424758_76
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

36
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.