Shortest paths on a polyhedron, part I: Computing shortest paths

International Journal of Computational Geometry and Applications

Volumn 6, Issue 2, 1996, Pages 127-144

  Chen, Jindong ^a,b   Han, Yijie ^a,c  

^a UNIVERSITY OF KENTUCKY   (United States)

^b Purdue University   (United States)

^c Electronic Data Systems   (United States)

Author keywords

Computational geometry; Computational robotics; Motion planning; Nonconvex polyhedron; Shortest path; Single source shortest path

Indexed keywords

EID: 0030535443     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000095     Document Type: Article

References (23)

1. P. Agarwal, B. Aronov, J. O'Rourke, and C. Schevon, "Star unfolding of a polytope with applications", Proc. of the Scandanavian Workshop on Algorithm Theory. LNCS 447, 1990.
2. B. Aronov, J. O'Rourke. "Nonoverlap of the star unfolding", in Proc. 1991 ACM Symp. on Computational Geometry.
3. J. Canny, "A new algebraic method for robot motion planning and real geometry", Proc. 1987 IEEE FOCS, pp. 39-48.
4. J. Canny, J. Reif, "New lower bound techniques for robot motion planning problems", Proc. 1987, IEEE FOCS, 49-60.
5. B. Chazelle, "Triangulating a simple polygon in linear time", Discrete and Computational Geometry, Vol. 6, 485-524(1991).
6. J. Chen and Y. Han, "Storing shortest paths for a polyhedron", Proc. 1991 Int. Conf. on Computing and Information. Lecture Notes in Comput. Sci., 497, 169-180.
7. E. W. Dijkstra, "A note on two problems in connection with graphs", Numer. Math., 1(1959), pp. 269-271.
8. D. G. Kirkpatrick, "Optimal search in planar subdivisions", SIAM J. COMPUT. 12 (1983), pp.28-35.
9. D. T. Lee, "Proximity and reachability in the plane", Ph.D. thesis, Technical Report ACT-12, Coordinated Science Laboratory, Univ. of Illinois, Chicago, IL, Nov. 1978.
10. D. T. Lee and F. P. Preparata, "Euclidean shortest paths in the presence of rectilinear boundaries", Network, 14(1984), pp. 393-410.
11. T. Lozano-Perez and M. A. Wesley, "An algorithm for planning collision-free paths among polyhedral obstacles", Comm. ACM, 22(1979), pp. 560-570.
12. J. S. B. Mitchell, "Shortest paths in the plane in the presence of obstacles", Manuscript, Dept. of Operations Research, Stanford Univ., Stanford, CA, 1984.
13. J. S. B. Mitchell, "Planning shortest paths", Ph.D. thesis, Dept. of Operation Research, Stanford, CA, August, 1986.
14. J. S. B. Mitchell, D. M. Mount and C. H. Papadimitriou, "The discrete geodesic problem", SIAM J. COMPUT. 16 (1987), pp.647-668.
15. D. M. Mount, "On finding shortest paths on convex polyhedra", Technical Report 1495, Department of Computer Science, University of Maryland, Baltimore, MD, 1985.
16. D. M. Mount, "The number of shortest paths on the surface of a polyhedron", Tec. Rep., Computer Sci. Dept., Univ. of Maryland, College Park, 1986.
17. J. O'Rourke, S. Suri and H. Booth, "Shortest path on polyhedral surfaces", Manuscript, The Johns Hopkins Univ., Baltimore, MD, 1984.
18. F. P. Preparata, "New approach to planar point location", SIAM J. COMPUT. 10(1981), pp.473-482.
19. J. Reif, J. A. Storer, "Shortest paths in Euclidean space with polyhedral obstacles", Tec. Rep. CS-85-121, Computer Science Dept., Brandeis Univ., Waltham, MA, April, 1985.
20. J. Reif, J. A. Storer, "3-Dimensional shortest paths in the presence of polyhedral obstacles", Proc. 1988 Foundations of Computer Sci., pp. 85-92.
21. C. Schevon, J. O'Rourke, "The number of maximum edges sequences on a convex polytope", Proc. Allerton Conference, 1988.
22. M. Shamos and D. Hoey, "Closest-point problems", Proc. 17th Annual IEEE FOCS, (Oct. 1975) pp. 151-162.
23. M. Sharir and A. Schorr, "On shortest paths in polyhedral spaces", SIAM J. COMPUT. 15(1986), pp. 193-215.