Determining approximate shortest paths on weighted polyhedral surfaces
- 1 January 2005
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 52 (1), 25-53
- https://doi.org/10.1145/1044731.1044733
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Approximate shortest path on a polyhedral surface and its applicationsComputer-Aided Design, 2001
- Approximating Shortest Paths on a Nonconvex PolyhedronSIAM Journal on Computing, 2000
- Constructing Approximate Shortest Path Maps in Three DimensionsSIAM Journal on Computing, 1999
- Approximating shortest paths on a convex polytope in three dimensionsJournal of the ACM, 1997
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHSInternational Journal of Computational Geometry & Applications, 1996
- The weighted region problemJournal of the ACM, 1991
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985
- Transportation, Social Physics, And The Law Of RefractionThe Professional Geographer, 1957