Fast Delaunay Triangulation for Converging Point Relocation Sequences - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Fast Delaunay Triangulation for Converging Point Relocation Sequences

Abstract

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. Experiments show 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 several times faster than rebuilding.
Fichier principal
Vignette du fichier
paper.pdf (394.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : inria-00413351 , version 1

Cite

Pedro Machado Manhães de Castro, Olivier Devillers. Fast Delaunay Triangulation for Converging Point Relocation Sequences. European Workshop on Computational Geometry, 2009, Bruxelles, Belgium. ⟨inria-00413351⟩
130 View
99 Download

Share

Gmail Facebook X LinkedIn More