Intersections with random geometric objects, Computational Geometry, vol.10, issue.3, 1995. ,
DOI : 10.1016/S0925-7721(98)00004-2
CGAL User and Reference Manual, 3 ,
THE DELAUNAY HIERARCHY, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.163-180, 2002. ,
DOI : 10.1142/S0129054102001035
URL : https://hal.archives-ouvertes.fr/inria-00166711
WALKING IN A TRIANGULATION, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.181-199, 2002. ,
DOI : 10.1142/S0129054102001047
URL : https://hal.archives-ouvertes.fr/inria-00344519
Expected time analysis for Delaunay point location, Computational Geometry, vol.29, issue.2, pp.61-89, 2004. ,
DOI : 10.1016/j.comgeo.2004.02.002
Classroom Examples of Robustness Problems in Geometric Computations, Proc. 12th European Symposium on Algorithms, pp.702-713, 2004. ,
DOI : 10.1007/978-3-540-30140-0_62
URL : https://hal.archives-ouvertes.fr/inria-00344515
Optimal Search in Planar Subdivisions, SIAM Journal on Computing, vol.12, issue.1, pp.28-35, 1983. ,
DOI : 10.1137/0212002
Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations, Proc. 12th Annu. Sympos, pp.274-283, 1996. ,
3D triangulations, CGAL User and Reference Manual. 3.5 edition, 2009. ,
THE EXACT COMPUTATION PARADIGM, Computing in Euclidean Geometry, pp.452-492, 1995. ,
DOI : 10.1142/9789812831699_0011