J. And-preparata and F. P. , Robust plane sweep for intersecting segments, Journal of Computer Graphics Techniques Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions, pp.1401-1421, 2000.

P. Bose and P. And-morin, Online Routing in Triangulations, SIAM Journal on Computing, vol.33, issue.4, pp.937-951, 2004.
DOI : 10.1137/S0097539700369387

URL : http://cg.scs.carleton.ca/~jit/publications/papers/bm99.ps

P. Bose, A. Brodnik, S. Carlsson, E. D. Demaine, and R. Fleischer,

O. , A. Morin, P. And, I. Munro, and J. , Online routing in convex subdivisions, International Journal of Computational Geometry & Applications, vol.12, issue.04, pp.283-295, 2002.

C. , B. And-guibas, and L. J. , Fractional cascading: I. a data structuring technique, Algorithmica, vol.1, issue.1, pp.133-162, 1986.

D. Berg, M. Van-kreveld, M. Overmars, M. And-schwarzkopf, and O. , Computational Geometry: Algorithms and Applications, p.32, 1997.

D. Org, O. And-hemsley, and R. , The worst visibility walk in a random Delaunay triangulation is o( n) URL: https, Journal of Computer Graphics Techniques Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions, pp.332-359, 2016.

D. , O. Pion, S. And-teillaud, and M. , Walking in a triangulation URL: https, International Journal of Foundations of Computer Science, vol.13, pp.181-199, 2002.

D. and O. , The Delaunay hierarchy, International Journal of Foundations of Computer Science, vol.13, pp.163-180, 2002.

, URL: https://hal.inria.fr/ inria-00166711, p.30

D. and O. , Delaunay triangulations, theory vs practice, 28th European Workshop on Computational Geometry, 2012.

D. , L. Lemaire, C. And-moreau, and J. , Expected time analysis for Delaunay point location, Computational geometry, vol.29, issue.2, pp.61-89, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01583988

K. and D. , Optimal search in planar subdivisions, SIAM Journal on Computing, vol.12, issue.1, pp.28-35, 1983.

K. , W. Ermolaev, V. And-berntsen, and H. , Zig-zagging in a triangulation, 2017.

K. and W. , Celestial walk demo. https://github.com/wkuijper/ celestial-walk-demo, p.42, 2017.

L. , G. Preparata, F. P. And-tamassia, and R. , Robust proximity queries: An illustration of degree-driven algorithm design, SIAM Journal on Computing, vol.28, issue.3, pp.864-889, 1998.

M. Ucke, E. P. Saias, I. And-zhu, and B. , Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations, Computational Geometry, vol.12, issue.98, pp.1-2, 1999.

P. and F. P. , Planar point location revisited, International Journal of Foundations of Computer Science, vol.1, issue.01, pp.71-86, 1990.

, THE CGAL PROJECT. 2017. CGAL User and Reference Manual, p.45

, Journal of Computer Graphics Techniques Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions, 2018.

W. Kuijper, V. Ermolaev, and O. Devillers, Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions, Journal of Computer Graphics Techniques (JCGT), vol.7, issue.30302, pp.29-49, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01610205

W. Kuijper and V. Ermolaev,

, The Authors provide this document (the Work) under the Creative Commons CC BY-ND 3.0 license available online at http://creativecommons.org/licenses/by-nd/3.0/. The Authors further grant permission for reuse of images and text from the first page of the Work, provided that the reuse is for the purpose of promoting and/or summarizing the Work in scholarly venues and that any reuse is accompanied by a scientific citation to the Work