Yevgeny Schreiber
ABSTRACT
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm runs in O(nlog n) time and requires O(nlog n) space, where n is the number of edges of P. The algorithm is based on the O(nlog n) algorithm of Hershberger and Suri for shortest paths in the plane [11], and similarly follows the continuous Dijkstra paradigm, which propagates a "wavefront" from s along ∂P. This is effected by generalizing the concept of conforming subdivision of the free space used in [11], and adapting it for the case of a convex polytope in R3, allowing the algorithm to accomplish the propagation in discrete steps, between the "transparent" edges of the subdivision. The algorithm constructs a dynamic version of Mount's data structure [16] that implicitly encodes the shortest paths from s to all other points of the surface. This structure allows us to answer single-source shortest-path queries, where the length of the path, as well as its combinatorial type, can be reported in O(log n) time; the actual path π can be reported in additional O(k) time, where k is the number of polytope edges crossed by π.The algorithm generalizes to the case of m source points to yield an implicit representation of the geodesic Voronoi diagram of m sites on the surface of P, in time O((n+m)log(n+m)), so that the site closest to a query point can be reported in time O(log(n+m)).
- P. K. Agarwal, S. Har-Peled, M. Sharir, and K. R. Varadarajan, Approximate shortest paths on a convex polytope in three dimensions, J. ACM 44:567--584, 1997. Google Scholar
Digital Library
- L. Aleksandrov, A. Maheshwari, and J.-R. Sack, An improved approximation algorithm for computing geometric shortest paths, 14th FCT, Lecture Notes Comput. Sci. 2751:246--257, 2003.Google ScholarCross Ref
- B. Aronov and J. O'Rourke, Nonoverlap of the star unfolding, Discrete Comput. Geom., 8:219--250, 1992.Google ScholarDigital Library
- J. Chen and Y. Han, Shortest paths on a polyhedron, Part I: Computing shortest paths, Internat. J. Comput. Geom. Appl. 6:127--144, 1996.Google ScholarCross Ref
- J. Chen and Y. Han, Shortest paths on a polyhedron, Part II: Storing shortest paths, Tech. Rept. 161-90, Comput. Sci. Dept., Univ. Kentucky, Lexington, KY, February 1990.Google Scholar
- J. R. Driscoll, D. D. Sleator, and R. E. Tarjan, Fully persistent lists with catenation, J. ACM 41(5):943--949, 1994. Google ScholarDigital Library
- S. Har-Peled, Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions, Discrete Comput. Geom., 21:216--231, 1999.Google Scholar
- S. Har-Peled, Constructing approximate shortest path maps in three dimensions, SIAM J. Comput., 28(4):1182--1197, 1999. Google ScholarDigital Library
- J. Hershberger and S. Suri, An optimal algorithm for Euclidean shortest paths in the plane, in Proc. 34th IEEE Sympos. Found. Comput. Sci., 508--517, 1993.Google Scholar
- J. Hershberger and S. Suri, An optimal algorithm for Euclidean shortest paths in the plane, Manuscript, Washington University, 1995.Google Scholar
- J. Hershberger and S. Suri, An optimal algorithm for Euclidean shortest paths in the plane, SIAM J. Comput. 28(6):2215--2256, 1999. Google ScholarDigital Library
- S. Kapoor, Efficient computation of geodesic shortest paths, in Proc. 32nd Annu. ACM Sympos. Theory Comput., New York, NY, USA: ACM Press, 770--779, 1999. Google ScholarDigital Library
- J. S. B. Mitchell, Shortest paths and networks, in J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry (2nd Edition), chapter 27, 607--641, North-Holland, Chapman & Hall/CRC, Boca Raton, FL, 2004. Google ScholarDigital Library
- J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou, The discrete geodesic problem, SIAM J. Comput. 16:647--668, 1987. Google ScholarDigital Library
- D. M. Mount, On finding shortest paths on convex polyhedra, Tech. Rept., Computer Sience Dept., Univ. Maryland, College Park, October 1984.Google Scholar
- D. M. Mount, Storing the subdivision of a polyhedral surface, Discrete Comput. Geom., 2:153--174, 1987.Google ScholarDigital Library
- J. O'Rourke, Computational geometry column 35, Internat. J. Comput. Geom. Appl., 9:513--515, 1999; also in SIGACT News, 30(2):31--32, (1999) Issue 111. Google ScholarDigital Library
- J. O'Rourke, Folding and unfolding in computational geometry, in Lecture Notes Comput. Sci., Vol. 1763, J. Akiyama, M. Kano, M. Urabe, editors, Springer Verlag, Berlin, 2000, pp. 258--266. Google ScholarDigital Library
- J. O'Rourke, S. Suri, and H. Booth, Shortest path on polyhedral surfaces, Manuscript, The Johns Hopkins Univ., Baltimore, MD,1984.Google Scholar
- R. P. Paul, Robot Manipulators: Mathematics, Programming, and Control, MIT Press, Cambridge, Massachusetts, 1981. Google ScholarDigital Library
- Y. Schreiber and M. Sharir, An optimal-time algorithm for shortest paths on a convex polytope in three dimensions, http://www.tau.ac.il/~syevgeny/ShortestPath.ps.Google Scholar
- M. Sharir, On shortest paths amidst convex polyhedra, SIAM J. Comput. 16:561--572, 1987. Google ScholarDigital Library
- M. Sharir and A. Schorr, On shortest paths in polyhedral spaces, SIAM J. Comput. 15:193--215, 1986. Google ScholarDigital Library
- K. R. Varadarajan and P.K. Agarwal, Approximating shortest paths on a nonconvex polyhedron, in Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci., 182--191, 1997. Google ScholarDigital Library
- E. W. Weisstein, Riemann Surface, MathWorld --- A Wolfram Web Resource, http://mathworld.wolfram.com/RiemannSurface.html.Google Scholar
- E. W. Weisstein, Unfolding, MathWorld --- A Wolfram Web Resource, http://mathworld.wolfram.com/Unfolding.html.Google Scholar
Index Terms
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Recommendations
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm runs in O(nlogźn) time and requires O(nlogźn) space, ...
Shortest paths on realistic polyhedra
SCG '07: Proceedings of the twenty-third annual symposium on Computational geometryWe generalize our optimal-time algorithm for computing (an implicitrepresentation of) the shortest-path map from a fixed source s onthe surface of a convex polytope P into three scenarios where P is a possibly nonconvex polyhedron. In the first scenario,...
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
We generalize our optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P to three realistic scenarios where P is a possibly nonconvex polyhedron. In the ...
Comments