Delaunay Triangulations for Moving Points - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Delaunay Triangulations for Moving Points


This paper considers the problem of updating efficiently a Delaunay triangulation when vertices are moving under small perturbations. Its main contribution is a set of algorithms based on the concept of vertex tolerance. Experiment shows that it is able to outperform the naive rebuilding algorithm in certain conditions. For instance, when points, in two dimensions, are relocated by Lloyd's iterations, our algorithm performs about several times faster than rebuilding.
Fichier principal
Vignette du fichier
RR-6750.pdf (1.53 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00344053 , version 1 (03-12-2008)


  • HAL Id : inria-00344053 , version 1


Pedro Machado Manhães de Castro, Olivier Devillers. Delaunay Triangulations for Moving Points. [Research Report] RR-6750, INRIA. 2008. ⟨inria-00344053⟩
367 View
624 Download


Gmail Facebook X LinkedIn More