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. © 2013 Springer-Verlag.
CITATION STYLE
Buchin, K., Devillers, O., Mulzer, W., Schrijvers, O., & Shewchuk, J. (2013). Vertex deletion for 3D Delaunay triangulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8125 LNCS, pp. 253–264). https://doi.org/10.1007/978-3-642-40450-4_22
Mendeley helps you to discover research relevant for your work.