Practical methods for approximating shortest paths on a convex polytope in R3

We propose an extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p, q on its surface, let dP(p, q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2dP(p, q) in time O(n). Extending this result, we can also compute an approximation of the shortest path tree rooted at an arbitrary point x ∈ P in time O(n log n). In the approximate tree, the distance between a vertex v ∈ P and x is at most cdP(x, v), where c = 2.38(1 + e) for any fixed e > 0. The best algorithms for computing an exact shortest path on a convex polytope take Ω(n2) time in the worst case; in addition, they are too complicated to be suitable in practice. We can also get a weak approximation result in the general case of k disjoint convex polyhedra: in O(n) time our algorithm gives a path of length at most 2k times the optimal.

[1]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[2]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[3]  Subhash Suri,et al.  Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[4]  Boris Aronov,et al.  Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..

[5]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[6]  D. Mount.  On Finding Shortest Paths on Convex Polyhedra. , 1985 .

[7]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.

[8]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[9]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  C. Bajaj.  The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .

[12]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[13]  Chee-Keng Yap,et al.  Approximate Euclidean shortest path in 3-space , 1994, SCG '94.

[14]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[15]  Micha Sharir,et al.  Approximating shortest paths on a convex polytope in three dimensions , 1997, JACM.

[16]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[17]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.