Shortest paths on polyhedral surfaces
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
SIAM Journal on Computing
Handbook of discrete and computational geometry
Efficient computation of geodesic shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Proceedings of the twenty-second annual symposium on Computational geometry
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.