Vertex deletion for 3D Delaunay triangulations

K. Buchin, O. Devillers, W. Mulzer, O.J. Schrijvers, J. Shewchuk

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

Abstract

We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C¿¿¿(P)) time, where P is the set of vertices neighboring q in DT(S) and C¿¿¿(P) is an upper bound on the expected number of tetrahedra whose circumspheres enclose q that are created during the randomized incremental construction of DT(P). Experiments show that our approach is significantly faster than existing implementations if q has high degree, and competitive if q has low degree.
Original languageEnglish
Title of host publicationAlgorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings)
EditorsH.L. Bodlaender, G.F. Italiano
Place of PublicationBerlin
PublisherSpringer
Pages253-264
ISBN (Print)978-3-642-40449-8
DOIs
Publication statusPublished - 2013
Event21st Annual European Symposium on Algorithms (ESA 2013) - Sophia Antipolis, France
Duration: 2 Sep 20134 Sep 2013
Conference number: 21st
http://www.informatik.uni-trier.de/~ley/db/conf/esa/esa2013.html

Publication series

NameLecture Notes in Computer Science
Volume8125
ISSN (Print)0302-9743

Conference

Conference21st Annual European Symposium on Algorithms (ESA 2013)
Abbreviated titleESA 2013
CountryFrance
CitySophia Antipolis
Period2/09/134/09/13
Internet address

Fingerprint Dive into the research topics of 'Vertex deletion for 3D Delaunay triangulations'. Together they form a unique fingerprint.

  • Cite this

    Buchin, K., Devillers, O., Mulzer, W., Schrijvers, O. J., & Shewchuk, J. (2013). Vertex deletion for 3D Delaunay triangulations. In H. L. Bodlaender, & G. F. Italiano (Eds.), Algorithms – ESA 2013 (21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings) (pp. 253-264). (Lecture Notes in Computer Science; Vol. 8125). Springer. https://doi.org/10.1007/978-3-642-40450-4_22