On Deletion in Delaunay Triangulations


This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if Ic is the degree of the deleted vertex, the complexity is O( Ic log Ic), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear… (More)
DOI: 10.1145/304893.304969


5 Figures and Tables


Citations per Year

89 Citations

Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.