Voronoi diagrams and Delaunay triangulations, 2013. ,
DOI : 10.1142/8685
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
URL : http://www.scs.carleton.ca/~morin/publications/online/triangulations-isaac99.ps
The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane, Advances in Applied Probability, vol.283, issue.04, pp.702-717, 2002. ,
DOI : 10.1007/BF02789327
Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation, 2017. ,
Delaunay triangulation based surface reconstruction . Effective computational geometry for curves and surfaces, pp.231-276, 2006. ,
DOI : 10.1007/978-3-540-33259-6_6
URL : https://hal.archives-ouvertes.fr/inria-00070610
Stretch factor of long paths in a planar Poisson-Delaunay triangulation, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01346203
Delaunay mesh generation, 2012. ,
Greedy lattice animals I: Upper bounds, Ann. Appl. Probab, pp.1151-1169, 1993. ,
Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path, Research Report, vol.8946, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01353585
The worst visibility walk in a random Delaunay triangulation is O( ? n), Journal of Computational Geometry, vol.7, pp.332-359, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01348831
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
URL : https://hal.archives-ouvertes.fr/hal-01583988
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 processes, ESAIM: Probability and Statistics, vol.20, pp.261-292, 2016. ,
DOI : 10.1007/978-3-540-78859-1
The Delaunay triangulation closely approximates the complete Euclidean graph, Proc. 1st Workshop Algorithms Data Struct, pp.47-56, 1989. ,
DOI : 10.1007/3-540-51542-9_6
Random Geometric Graphs, 2003. ,
DOI : 10.1093/acprof:oso/9780198506263.001.0001
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, 2011. ,
Surface order scaling in stochastic geometry, The Annals of Applied Probability, vol.25, issue.1, pp.177-210, 2015. ,
DOI : 10.1214/13-AAP992
URL : http://arxiv.org/pdf/1312.6595
Asymptotic theory for statistics of the Poisson???Voronoi approximation, Bernoulli, vol.22, issue.4, pp.2372-2400, 2016. ,
DOI : 10.3150/15-BEJ732