N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas, Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces, Proceedings of the 36th International Conference on Graph Theoretic Concepts in Computer Science (WG 2010), pp.266-278, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00454565

N. Bonichon and J. Marckert, Asymptotics of geometrical navigation on a random set of points in the plane, Advances in Applied Probability, vol.43, issue.4, pp.899-942, 2011.

P. Bose, J. Carufel, and O. Devillers, Expected Complexity of Routing in ? 6 and Half-? 6 Graphs, INRIA, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02338733

P. Bose, R. Fagerberg, A. Van-renssen, and S. Verdonschot, Optimal local routing on Delaunay triangulations defined by empty equilateral triangles, SIAM Journal on Computing, vol.44, issue.6, pp.1626-1649, 2015.

P. Bose and P. Morin, Online routing in triangulations, SIAM Journal on Computing, vol.33, issue.4, pp.937-951, 2004.

P. Bose and M. Smid, On plane geometric spanners: A survey and open problems, Computational Geometry: Theory and Applications, vol.46, issue.7, pp.818-830, 2013.

P. Chew, There are planar graphs almost as good as the complete graph, Journal of Computer and System Sciences, vol.39, issue.2, pp.205-219, 1989.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

J. E. Hopcroft and R. E. Tarjan, Algorithm 447: Efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973.

C. Y. Lee, An algorithm for path connection and its applications, IRE Transaction on Electronic Computers, EC, vol.10, issue.3, pp.346-365, 1961.

E. F. Moore, The shortest path through a maze, Proceedings of the International Symposium on the Theory of Switching, pp.285-292, 1959.

G. Narasimhan and M. Smid, Geometric Spanner Networks, 2007.