Approximating shortest paths on a convex polytope in three dimensions
- 1 July 1997
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 44 (4), 567-584
- https://doi.org/10.1145/263867.263869
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Determining the separation of preprocessed polyhedra — A unified approachPublished by Springer Nature ,2005
- Constructing approximate shortest path maps in three dimensionsPublished by Association for Computing Machinery (ACM) ,1998
- Diameter, width, closest line pair, and parametric searchingDiscrete & Computational Geometry, 1993
- On the shortest paths between two convex polyhedraJournal of the ACM, 1988
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985
- Metric entropy of some classes of sets with differentiable boundariesJournal of Approximation Theory, 1974
- Extrinsic Geometry of Convex SurfacesPublished by American Mathematical Society (AMS) ,1973