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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Joe, B.: Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design 8, 123–142 (1991)
Cignoni, P., Montani, C., Scopigno, R.: DeWall: a fast divide & conquer Delaunay triangulation algorithm in Ed. Computer-Aided Design 30, 333–341 (1998)
Watson, D.F.: Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Computer Journal 24, 167–172 (1981)
Chew, L.P.: Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dartmouth College, Computer Science, Hanover, NH (1990)
Devillers, O.: On deletion in Delaunay triangulations. International Journal of Computational Geometry and Applications 12, 193–205 (2002)
Mostafavi, M.A., Gold, C.M., Dakowicz, M.: Delete and insert operations in Voronoi/Delaunay methods and applications. Computers & Geosciences 29, 523–530 (2003)
Devillers, O., Teillaud, M.: Perturbations and vertex removal in a 3D Delaunay tri-angulation. In: Proceedings 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, USA, pp. 313–319 (2003)
Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete & Computational Geometry 19, 1–17 (1998)
Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. Discrete & Computational Geometry 1, 25–44 (1986)
Joe, B.: Three-dimensional triangulations from local transformations. SIAM Journal on Scientific and Statistical Computing 10, 718–741 (1989)
Rajan, V.T.: Optimality of the Delaunay triangulation in ℝd. In: Proceedings 7th Annual Symposium on Computational Geometry, North Conway, New Hampshire, USA, pp. 357–363. ACM Press, New York (1991)
Schönhardt, E.: Über die zerlegung von dreieckspolyedern in tetraeder. Mathema- tische Annalen 98, 309–312 (1928)
Lawson, C.L.: Properties of n-dimensional triangulations. Computer Aided Geometric Design 3, 231–246 (1986)
Shewchuk, J.R.: Updating and constructing constrained Delaunay and constrained regular triangulations by flips. In: Proceedings 19th Annual Symposium on Computational Geometry, San Diego, USA, pp. 181–190. ACM Press, New York (2003)
Edelsbrunner, H., Mücke, E.P.: Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 66–104 (1990)
Shewchuk, J.R.: Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. In: Proceedings 16th Annual Symposium on Computational Geometry, Hong Kong, pp. 350–359. ACM Press, New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ledoux, H., Gold, C.M., Baciu, G. (2005). Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_76
Download citation
DOI: https://doi.org/10.1007/11424758_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25860-5
Online ISBN: 978-3-540-32043-2
eBook Packages: Computer ScienceComputer Science (R0)