On Deletion in Delaunay Triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2002

On Deletion in Delaunay Triangulations

Olivier Devillers


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 O(k 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.
Fichier principal
Vignette du fichier
hal.pdf (165.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00167201 , version 1 (16-08-2007)



Olivier Devillers. On Deletion in Delaunay Triangulations. International Journal of Computational Geometry and Applications, 2002, 12, pp.193-205. ⟨10.1142/S0218195902000815⟩. ⟨inria-00167201⟩
101 View
1644 Download



Gmail Facebook X LinkedIn More