Practical methods for approximating shortest paths on a convex polytope in R3
- 30 April 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 10 (1), 31-46
- https://doi.org/10.1016/s0925-7721(97)00004-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985
- On Finding Shortest Paths on Convex Polyhedra.Published by Defense Technical Information Center (DTIC) ,1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979