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

P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer et al., ONLINE ROUTING IN CONVEX SUBDIVISIONS, International Journal of Computational Geometry & Applications, vol.12, issue.04, pp.283-29510, 2002.
DOI : 10.1142/S021819590200089X

P. Bose, P. Carmi, M. Smid, and D. Xu, Communication-Efficient Construction of the Plane Localized Delaunay Graph, LATIN 2010: Theoretical Informatics, pp.282-293, 2010.
DOI : 10.1007/978-3-642-12200-2_26

A. Bowyer, Computing Dirichlet tessellations, The Computer Journal, vol.24, issue.2, pp.162-166, 1981.
DOI : 10.1093/comjnl/24.2.162

N. Broutin, O. Devillers, and R. Hemsley, Efficiently navigating a random Delaunay triangulation Combinatorial and Asymptotic Methods for the Analysis of Algorithms URL https, Proceedings of the 25th International Conference on Probabilistic DMTCS-HAL Proceedings Series, pp.49-60, 2014.

. Cgal, Computational Geometry Algorithms Library

J. T. Cox, A. Gandolfi, P. S. Griffin, and H. Kesten, Greedy lattice animals I: Upper bounds. The Annals of Applied Probability, pp.1151-1169, 1993.

O. Devillers, S. Pion, and M. Teillaud, WALKING IN A TRIANGULATION, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.181-19910, 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

J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, Geometric spanner for routing in mobile networks, Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing , MobiHoc '01, pp.174-185, 2005.
DOI : 10.1145/501416.501424

P. J. Green and R. Sibson, Computing Dirichlet Tessellations in the Plane, The Computer Journal, vol.21, issue.2, pp.168-173, 1978.
DOI : 10.1093/comjnl/21.2.168

G. R. Grimmett, Percolation (Grundlehren der mathematischen Wissenschaften), 2010.

G. Kozma, Z. Lotker, M. Sharir, and G. Stupp, Geometrically aware communication in random wireless networks, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.310-319, 2004.
DOI : 10.1145/1011767.1011813

C. L. Lawson, Software for C 1 surface interpolation, Mathematical Software III, pp.161-194, 1977.

S. Lee, The power laws of M and N in greedy lattice animals. Stochastic processes and their applications, pp.275-28710, 1997.

L. Pimentel, On some fundamental aspects of polyominoes on random Voronoi tilings, Brazilian Journal of Probability and Statistics, vol.27, issue.1, pp.54-69, 2013.
DOI : 10.1214/11-BJPS150

L. P. Pimentel and R. Rossignol, Greedy polyominoes and first-passage times on random Voronoi tilings, Electron. J. Probab, vol.17, issue.12, pp.1-31

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

B. Zhu, On Lawson???s Oriented Walk in Random Delaunay Triangulations, Fundamentals of Computation Theory, pp.222-233, 2003.
DOI : 10.1007/978-3-540-45077-1_21