Efficiently Navigating a Random Delaunay Triangulation - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Efficiently Navigating a Random Delaunay Triangulation

(1) , (2) , (2)
1
2
Nicolas Broutin
  • Function : Author
  • PersonId : 874919
Olivier Devillers
Ross Hemsley
  • Function : Author

Abstract

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
Vignette du fichier
aofa.pdf (197.1 Ko) Télécharger le fichier
Vignette du fichier
vignette.png (72.62 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Format : Figure, Image
Loading...

Dates and versions

hal-01018174 , version 1 (03-07-2014)

Identifiers

  • HAL Id : hal-01018174 , version 1

Cite

Nicolas Broutin, Olivier Devillers, Ross Hemsley. Efficiently Navigating a Random Delaunay Triangulation. AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France. ⟨hal-01018174⟩

Collections

INRIA INRIA2 ANR
227 View
205 Download

Share

Gmail Facebook Twitter LinkedIn More