O. Aichholzer, S. W. Bae, L. Barba, P. Bose, M. Korman et al., Theta-3 is connected, Computational Geometry: Theory and Applications, vol.47, issue.9, pp.910-917, 2014.

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-00536710

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, D. Hill, H. M. Michiel, and . Smid, On the spanning and routing ratio of Theta-four, Symposium on Discrete Algorithms, pp.2361-2370, 2019.

P. Bose, J. Carufel, and P. Morin, André van Renssen, and Sander Verdonschot. Towards tight bounds on theta-graphs: More is not always better, Journal of Computational Geometry jocg.org, vol.616, pp.70-93, 2016.

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, P. Morin, A. Van-renssen, and S. Verdonschot, The ? 5 -graph is a spanner, Computational Geometry: Theory and Applications, vol.48, issue.2, pp.108-119, 2015.

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. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

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

V. Korolev and I. Shevtsova, An improvement of the berry-esseen inequality with applications to poisson and mixed poisson random sums, Scandinavian Actuarial Journal, pp.1-25, 2010.

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. 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.

J. Ruppert and R. Seidel, Approximating the d-dimensional complete Euclidean graph, Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp.207-210, 1991.

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