Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)

DOI10.1016/S0925-7721(97)00004-7zbMath0896.68140MaRDI QIDQ1388131

J. E. Hershberger, Subhash Suri

Publication date: 1 October 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

convex polytopeshortest paths

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Shortest monotone descent path problem in polyhedral terrain ⋮ Approximation algorithms for cutting a convex polyhedron out of a sphere ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ Approximation algorithms for the watchman route and zookeeper's problems. ⋮ A survey of geodesic paths on 3D surfaces ⋮ On the upper bound on the average distance from the Fermat-Weber center of a convex body ⋮ Approximate Shortest Paths in Polygons with Violations ⋮ Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Improved stretch factor of Delaunay triangulations of points in convex position

Cites Work

• Unnamed Item
• An algorithm for shortest-path motion in three dimensions
• The Discrete Geodesic Problem
• Optimal Point Location in a Monotone Subdivision
• On Shortest Paths in Polyhedral Spaces
• Optimal Search in Planar Subdivisions
• Star Unfolding of a Polytope with Applications

This page was built for publication: Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)