Shortest paths on a polyhedron

We present an algorithm for determining the shortest path between a source point and any destination point along the surface of a polyhedron (need not be convex). Our algorithm uses a new approach which deviates from the conventional “continuous Dijkstra” technique. It takes <italic>&Ogr;</italic>(<italic>n</italic><supscrpt>2</supscrpt>) time and ⊖(<italic>n</italic>) space to determine the shortest path and to compute the inward layout which can be used to construct a structure for processing queries of shortest path from the source point to any destination point.

[1]  Franco P. Preparata,et al.  A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[2]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Boris Aronov,et al.  Star Unfolding of a Polytope with Applications (Extended Abstract) , 1990, SWAT.

[5]  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).

[6]  J. Reif,et al.  Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .

[7]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[8]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9]  Ruei-Chuan Chang,et al.  Finding All Shortest Path Edge Sequences on a Convex Polyhedron , 1989, WADS.

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

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

[12]  James A. Storer,et al.  3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles , 1988, MFCS.

[13]  David M. Mount,et al.  The Number of Shortest Paths on the Surface of a Polyhedron , 1990, SIAM J. Comput..

[14]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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