Delaunay Triangulations for Moving Points

Pedro Machado Manhães de Castro 1 Olivier Devillers 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
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. 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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00344053
Contributor : Pedro Machado Manhaes de Castro <>
Submitted on : Wednesday, December 3, 2008 - 3:13:28 PM
Last modification on : Monday, May 28, 2018 - 3:38:02 PM
Long-term archiving on: Monday, June 7, 2010 - 11:42:33 PM

File

RR-6750.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00344053, version 1

Collections

Citation

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

Share

Metrics

Record views

626

Files downloads

520