On shortest paths in polyhedral spaces
SIAM Journal on Computing
Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On shortest paths amidst convex polyhedra
SIAM Journal on Computing
SIAM Journal on Computing
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Approximate Euclidean shortest path in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A single-exponential upper bound for finding shortest paths in three dimensions
Journal of the ACM (JACM)
Star Unfolding of a Polytope with Applications
SIAM Journal on Computing
Practical methods for approximating shortest paths on a convex polytope in R3
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Exact geodesic metric in 2-manifold triangle meshes using edge-based data structures
Computer-Aided Design
| Hi-index | 0.00 |