Proceedings of the twelfth annual symposium on Computational geometry
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Modified DAG Location for Delaunay Triangulation
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Java applets for the dynamic visualization of Voronoi diagrams
Computer Science in Perspective
Expected time analysis for Delaunay point location
Computational Geometry: Theory and Applications
HCPO: an efficient insertion order for incremental Delaunay triangulation
Information Processing Letters
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Efficient query processing on unstructured tetrahedral meshes
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
HCPO: an efficient insertion order for incremental Delaunay triangulation
Information Processing Letters
Applying natural neighbor coordinates for electromagnetic tracker calibration
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.