PLANAR POINT LOCATION REVISITED, International Journal of Foundations of Computer Science, vol.01, issue.01, pp.71-86, 1990. ,
DOI : 10.1142/S0129054190000072
Optimal Search in Planar Subdivisions, SIAM Journal on Computing, vol.12, issue.1, pp.28-35, 1983. ,
DOI : 10.1137/0212002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1866
Software for C 1 surface interpolation, Math. Software III, pp.161-194, 1977. ,
DOI : 10.1016/b978-0-12-587260-7.50011-x
Computing Dirichlet Tessellations in the Plane, The Computer Journal, vol.21, issue.2, pp.168-173, 1978. ,
DOI : 10.1093/comjnl/21.2.168
Computing Dirichlet tessellations, The Computer Journal, vol.24, issue.2, pp.162-166, 1981. ,
DOI : 10.1093/comjnl/24.2.162
URL : http://comjnl.oxfordjournals.org/cgi/content/short/24/2/162
Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations, Proc. 12th Annu. ACM Sympos, pp.274-283, 1996. ,
Triangulation de Delaunay et arbres multidimensionnels, Thèse de doctorat en sciences, ´ Ecole des Mines de St, 1997. ,
URL : https://hal.archives-ouvertes.fr/tel-00850521
LEDA: A Platform for Combinatorial and Geometric Computing, 2000. ,
dimensions, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.251-260, 1990. ,
DOI : 10.1145/73833.73850
On sorting triangles in a delaunay tessellation, Algorithmica, vol.6, issue.1-6, pp.522-532, 1991. ,
DOI : 10.1007/BF01759057
Triangulation de Delaunay et maillage . Applications auxélémentsaux´auxéléments finis, Hermes, 1997. ,
Intersections with random geometric objects, Computational Geometry, vol.10, issue.3, 1995. ,
DOI : 10.1016/S0925-7721(98)00004-2
URL : http://doi.org/10.1016/s0925-7721(98)00004-2
A Note on Point Location in Delaunay Triangulations of Random Points, Algorithmica, vol.22, issue.4, pp.477-482, 1998. ,
DOI : 10.1007/PL00009234
Triangulations in CGAL, Proc. 16th Annu. ACM Sympos, pp.11-18, 2000. ,
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408