On Deletion in Delaunay TriangulationsReport as inadecuate

On Deletion in Delaunay Triangulations - Download this document for free, or read online. Document in PDF available to download.

1 GEOMETRICA - Geometric computing CRISAM - Inria Sophia Antipolis - Méditerranée

Abstract : 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 k is the degree of the deleted vertex, the complexity is Ok log k, but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear number of times. This algorithm may be viewed as a variation of Heller-s algorithm Heller, Symp. Spatial Data Handling 1990 which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.

Author: Olivier Devillers -

Source: https://hal.archives-ouvertes.fr/


Related documents