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

Olivier Devillers (1)

1 GEOMETRICA - Geometric computing

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.

Domaines: Géométrie algorithmique [cs.CG]

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⟩