Efficiently Navigating a Random Delaunay Triangulation
Résumé
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. Whilst many algorithms have been proposed, very little theoretical analysis is available for the properties of the paths generated or the computational resources required to generate them. In this work, we propose and analyse a new planar navigation algorithm for the Delaunay triangulation. We then demonstrate a number of strong theoretical guarantees for the algorithm when it is applied to a random set of points in a convex region.
Fichier principal
aofa.pdf (197.1 Ko)
Télécharger le fichier
vignette.png (72.62 Ko)
Télécharger le fichier
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
| Format | Figure, Image |
|---|
Loading...