Delaunay triangulation of imprecise points, preprocess and actually get a fast query time

Olivier Devillers 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : We propose a new algorithm to preprocess a set of n disjoint unit disks in O(n log n) expected time, allowing to compute the Delaunay triangulation of a set of n points, one from each disk, in O(n) expected time. This work reaches the same asymptotical theoretical complexities as previous results on this problem, but our algorithm is much simpler and efficient in practice.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download


https://hal.inria.fr/hal-00850583
Contributor : Olivier Devillers <>
Submitted on : Wednesday, August 7, 2013 - 1:24:52 PM
Last modification on : Saturday, January 27, 2018 - 1:31:24 AM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 7:42:14 PM

Files

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00850583, version 1

Collections

Citation

Olivier Devillers. Delaunay triangulation of imprecise points, preprocess and actually get a fast query time. XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain. ⟨hal-00850583⟩

Share

Metrics

Record views

320

Files downloads

164