Delaunay triangulation of imprecise points, preprocess and actually get a fast query time
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.
Domains
Computational Geometry [cs.CG]
Fichier principal
hal.pdf (288.66 Ko)
Télécharger le fichier
vignette.jpg (13.97 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...