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
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
Online Routing in Triangulations, SIAM Journal on Computing, vol.33, issue.4, pp.937-951, 2004. ,
DOI : 10.1137/S0097539700369387
Delaunay triangulation based surface reconstruction, Effective computational geometry for curves and surfaces, pp.70610-231, 2006. ,
Stretch factor of long paths in a planar Poisson- Delaunay triangulation, Research report, INRIA, 2016, Note to reviewer: we will make supplementary data available in HAL repository ,
Delaunay mesh generation, pp.2012-3156288 ,
Greedy lattice animals I: Upper bounds, The Annals of Applied Probability, pp.1151-1169, 1993. ,
The worst visibility walk in a random Delaunay triangulation is O( ? n), Research Report, vol.8792, p.1216212, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01348831
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
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
Delaunay graphs are almost as good as complete graphs, Discrete Comput. Geom, vol.5, pp.399-407, 1990. ,
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length, Theoretical Computer Science, vol.624, pp.41-55, 2015. ,
DOI : 10.1016/j.tcs.2015.12.015
Moderate deviations for shortest-path lengths on random segment process, 2016. ,
The Delaunay triangulation closely approximates the complete Euclidean graph, Proc. 1st Workshop Algorithms Data Struct, pp.10-1007, 1989. ,
DOI : 10.1007/3-540-51542-9_6
Stochastic and integral geometry, Probability and Its Applications, 2008. ,
The Stretch Factor of the Delaunay Triangulation Is Less than 1.998, SIAM Journal on Computing, vol.42, issue.4, pp.1620-1659, 2013. ,
DOI : 10.1137/110832458
Toward the tight bound of the stretch factor of Delaunay triangulations, Proceedings 23th Canadian Conference on Computational Geometry, p.cccg.ca, 2011. ,