Practical methods for approximating shortest paths on a convex polytope in R^3

DOI10.1016/S0925-7721(97)00004-7MaRDI QIDQ1388131zbMATH OpenFDO

Authors John Hershberger, Subhash Suri

Publication date 1 October 1998

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(97)00004-7

zbMATH Keywords

convex polytopeshortest paths

Mathematics Subject Classification ID

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

Recommendations

• Publication:4886077
• Approximating shortest paths on a convex polytope in three dimensions
• Computing approximate shortest paths on convex polytopes
• Approximating shortest paths on a nonconvex polyhedron

Cites work

• An algorithm for shortest-path motion in three dimensions
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• On Shortest Paths in Polyhedral Spaces
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Star Unfolding of a Polytope with Applications
• The Discrete Geodesic Problem

Cited in

(18)

• Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
• Approximation algorithms for the watchman route and zookeeper's problems.
• Computing approximate shortest paths on convex polytopes
• On the upper bound on the average distance from the Fermat-Weber center of a convex body
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Approximating shortest paths on a nonconvex polyhedron
• Approximate shortest paths in simple polyhedra
• Approximation algorithms for cutting a convex polyhedron out of a sphere
• Approximation algorithms for cutting a convex polyhedron out of a sphere
• Approximating shortest paths on a convex polytope in three dimensions
• scientific article; zbMATH DE number 910902 (Why is no real title available?)
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• Approximate Shortest Paths in Polygons with Violations
• Improved stretch factor of Delaunay triangulations of points in convex position
• Approximate shortest path on a polyhedral surface and its applications
• A survey of geodesic paths on 3D surfaces
• Shortest monotone descent path problem in polyhedral terrain

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388131)