On Deletion in Delaunay Triangulation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

On Deletion in Delaunay Triangulation

Olivier Devillers

Abstract

This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is O(k\log k), but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunalty Heller algorithm is false as explained in this paper.
Fichier principal
Vignette du fichier
RR-3451.pdf (271.47 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073239 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073239 , version 1

Cite

Olivier Devillers. On Deletion in Delaunay Triangulation. RR-3451, INRIA. 1998. ⟨inria-00073239⟩
85 View
1187 Download

Share

Gmail Facebook X LinkedIn More