Filtering Relocations on a Delaunay Triangulation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Graphics Forum Year : 2009

Filtering Relocations on a Delaunay Triangulation

Jane Tournois
  • Function : Author
  • PersonId : 857875
Pierre Alliez
Olivier Devillers

Abstract

Updating a Delaunay triangulation when its vertices move is a bottleneck in several domains of application. Rebuilding the whole triangulation from scratch is surprisingly a very viable option compared to relocating the vertices. This can be explained by several recent advances in efficient construction of Delaunay triangulations. However, when all points move with a small magnitude, or when only a fraction of the vertices move, rebuilding is no longer the best option. This paper considers the problem of efficiently updating a Delaunay triangulation when its vertices are moving under small perturbations. The main contribution is a set of filters based upon the concept of vertex tolerances. Experiments show that filtering relocations is faster than rebuilding the whole triangulation from scratch under certain conditions.
Fichier principal
Vignette du fichier
paper.pdf (1.56 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00413344 , version 1 (03-09-2009)

Identifiers

Cite

Pedro Machado Manhães de Castro, Jane Tournois, Pierre Alliez, Olivier Devillers. Filtering Relocations on a Delaunay Triangulation. Computer Graphics Forum, 2009, ⟨10.1111/j.1467-8659.2009.01523.x⟩. ⟨inria-00413344⟩
155 View
471 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More