N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas, Connections between thetagraphs , delaunay triangulations, and orthogonal surfaces, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00536710

N. Bonichon, C. Gavoille, N. Hanusse, and L. Perkovi´cperkovi´c, Plane Spanners of Maximum Degree Six, 37 th International Colloquium on Automata, Languages and Programming (ICALP), volume Lecture Notes in Computer Science, 2010.
DOI : 10.1007/978-3-642-14165-2_3
URL : https://hal.archives-ouvertes.fr/hal-00534212

]. L. Che89, ]. K. Paul-chewcla87, and . Clarkson, There are planar graphs almost as good as the complete graph Approximation algorithms for shortest path motion planning, STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp.205-219, 1987.

E. Jacob, J. Goodman, and . Rourke, Handbook of discrete and computational geometry, 1997.

]. J. Kei88, Approximating the complete euclidean graph, No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory, pp.208-213, 1988.

X. Li, I. Stojmenovic, and Y. Wang, Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.4, pp.350-361, 2004.
DOI : 10.1109/TPDS.2004.1271184
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.7192

G. Narasimhan and M. Smid, Geometric Spanner Networks, 2007.
DOI : 10.1017/CBO9780511546884

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs, 2000.
DOI : 10.1137/1.9780898719772

D. Peleg and J. D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM Journal on Computing, vol.18, issue.4, pp.740-747, 1989.
DOI : 10.1137/0218050

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