F. Baccelli, K. Tchoumatchenko, and S. Zuyev, Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks, Advances in Applied Probability, vol.32, issue.01, pp.1-18, 2000.
DOI : 10.1007/BF02187821

P. Bose and L. Devroye, On the stabbing number of a random Delaunay triangulation, Computational Geometry, vol.36, issue.2, pp.89-105, 2006.
DOI : 10.1016/j.comgeo.2006.05.005

P. Bose and P. Morin, Online Routing in Triangulations, SIAM Journal on Computing, vol.33, issue.4, pp.937-95110, 2004.
DOI : 10.1137/S0097539700369387

N. Broutin, O. Devillers, and R. Hemsley, Efficiently navigating a random Delaunay triangulation. Random Structures and Algorithms, p.46, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00940743

. Cgal, Computational Geometry Algorithms Library

N. Chenavier and O. Devillers, Stretch Factor of Long Paths in a planar Poisson-Delaunay Triangulation, URL, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01346203

O. Devillers and R. Hemsley, The worst visibility walk in a random Delaunay triangulation is O( ? n) URL https, Journal of Computational Geometry, vol.7, issue.1, pp.332-359, 2016.

O. Devillers, S. Pion, and M. Teillaud, WALKING IN A TRIANGULATION, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.181-199, 2002.
DOI : 10.1142/S0129054102001047

URL : https://hal.archives-ouvertes.fr/inria-00344519

L. Devroye, C. Lemaire, and J. Moreau, Expected time analysis for Delaunay point location, Computational Geometry, vol.29, issue.2, pp.61-89, 2004.
DOI : 10.1016/j.comgeo.2004.02.002

R. Schneider and W. Weil, Stochastic and Integral Geometry. Probability and Its Applications, 2008.