Fast Delaunay Triangulation for Converging Point Relocation Sequences

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

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00413351
Contributor : Pedro Machado Manhaes de Castro <>
Submitted on : Thursday, September 3, 2009 - 6:16:00 PM
Last modification on : Saturday, January 27, 2018 - 1:31:33 AM
Long-term archiving on : Tuesday, June 15, 2010 - 11:10:58 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00413351, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

320

Files downloads

143