J. Boissonnat, P. Franco, and . Preparata, Robust Plane Sweep for Intersecting Segments, SIAM Journal on Computing, vol.29, issue.5, pp.1401-142110, 2000.
DOI : 10.1137/S0097539797329373
URL : https://hal.archives-ouvertes.fr/inria-00073419

P. Bose, A. Brodnik, S. Carlsson, D. Erik, R. Demaine et al., ONLINE ROUTING IN CONVEX SUBDIVISIONS, International Journal of Computational Geometry & Applications, vol.12, issue.04, pp.283-29510, 2002.
DOI : 10.1016/0020-0190(72)90045-2

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.3251

B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica, vol.3, issue.2, pp.133-16210, 1986.
DOI : 10.1007/BF01840440

M. Mark-de-berg, M. Van-kreveld, O. Overmars, and . Schwarzkopf, Computational Geometry: Algorithms and Applications, 1997.

O. Devillers, THE DELAUNAY HIERARCHY, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.163-180, 2002.
DOI : 10.1016/S0925-7721(96)00025-9
URL : https://hal.archives-ouvertes.fr/inria-00166711

O. Devillers, Delaunay triangulations, theory vs practice, EuroCG, 28th European Workshop on Computational Geometry
URL : https://hal.archives-ouvertes.fr/hal-00850561

O. Devillers and R. Hemsley, The worst visibility walk in a random Delaunay triangulation is O( n) URL: https, Journal of Computational Geometry, vol.7, issue.1, pp.332-359, 2016.

O. Devillers, S. Pion, and M. Teillaud, WALKING IN A TRIANGULATION, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.181-199, 2002.
DOI : 10.1007/BF01759057
URL : https://hal.archives-ouvertes.fr/inria-00072509

L. Devroye, C. Lemaire, and J. Moreau, Expected time analysis for Delaunay point location, Computational Geometry, vol.29, issue.2, pp.61-8910, 2004.
DOI : 10.1016/j.comgeo.2004.02.002
URL : https://hal.archives-ouvertes.fr/hal-01583988

D. Kirkpatrick, Optimal Search in Planar Subdivisions, SIAM Journal on Computing, vol.12, issue.1, pp.28-3510, 1983.
DOI : 10.1137/0212002
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.461.1866&rep=rep1&type=pdf

W. Kuijper, Celestial walk demo. https://github.com/wkuijper/ celestial-walk-demo, 2017.

W. Kuijper, V. Ermolaev, and H. Berntsen, Zig-zagging in a triangulation. arXiv preprint, 2017.

G. Liotta, P. Franco, R. Preparata, and . Tamassia, Robust proximity queries, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.864-889, 1998.
DOI : 10.1145/262839.262922

P. Ernst, I. Mücke, B. Saias, and . Zhu, Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations, Computational Geometry, vol.12, issue.1298, pp.63-8310, 1999.

P. Franco and . Preparata, Planar point location revisited, S0129054190000072. Inria RESEARCH CENTRE NANCY ? GRAND EST 615 rue du Jardin Botanique CS20101 54603 Villers-lès-Nancy Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria.fr ISSN, pp.71-86, 1990.