Delaunay triangulation of imprecise points, preprocess and actually get a fast query time
We propose a new algorithm to preprocess a set of <em>n</em> disjoint unit disks in <em>O</em>(<em>n</em> log <em>n</em>) expected time, allowing to compute the Delaunay triangulation of a set of <em>n</em> points, one from each disk, in &l...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2011-05-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/41 |