Approximating shortest paths on a convex polytope in three dimensions

DOI10.1145/263867.263869zbMath0890.68126OpenAlexW2012669981MaRDI QIDQ4377587

Kasturi R. Varadarajan, Sariel Har-Peled, Pankaj K. Agarwal, Micha Sharir

Publication date: 17 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

shortest pathconvex polytope

Mathematics Subject Classification ID

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

Related Items (12)

Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ On the total curvature of minimizing geodesics on convex surfaces ⋮ Geometric spanners for weighted point sets ⋮ Total curvature and spiralling shortest paths ⋮ A survey of geodesic paths on 3D surfaces ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Time-minimal paths amidst moving obstacles in three dimensions ⋮ On time-optimal trajectories in non-uniform mediums

This page was built for publication: Approximating shortest paths on a convex polytope in three dimensions