论文信息 - Walking in a triangulation - 字舞流文

Walking in a triangulation

Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.

Olivier Devillers | Sylvain Pion | Monique Teillaud | M. Teillaud | O. Devillers | S. Pion

[1] Mark de Berg,et al. Simple traversal of a subdivision without extra storage , 1996, SCG '96.

[2] Herbert Edelsbrunner,et al. An acyclicity theorem for cell complexes ind dimension , 1990, Comb..

[3] Herbert Edelsbrunner,et al. An acyclicity theorem for cell complexes in d dimensions , 1989, SCG '89.

[4] Prosenjit Bose,et al. Intersections with random geometric objects , 1998, Comput. Geom..

[5] Luc Devroye,et al. A Note on Point Location in Delaunay Triangulations of Random Points , 1998, Algorithmica.

[6] Mariette Yvinec,et al. Triangulations in CGAL , 2002, Comput. Geom..

[7] Christophe Lemaire,et al. Triangulation de Delaunay et arbres multidimensionnels , 1997 .

[8] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[9] C. Lawson. Software for C1 Surface Interpolation , 1977 .

[10] Ernst P. Mücke,et al. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations , 1996, SCG '96.

[11] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[12] Olivier Devillers. Improved incremental randomized Delaunay triangulation , 1998, SCG '98.

[13] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[14] Mariette Yvinec,et al. Triangulations in CGAL (extended abstract) , 2000, SCG '00.