New results on shortest paths in three dimensions

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 124-133

  Mitchell, Joseph S B ^a   Sharir, Micha ^b  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Motion planning; NP hardness; Shortest path; Terrain

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; MOTION PLANNING; PROBLEM SOLVING; SET THEORY;

EUCLIDEAN METRICS; NP-HARDNESS; SHORTEST PATH; TERRAIN;

COMPUTATIONAL GEOMETRY;

EID: 4544228683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997839     Document Type: Conference Paper

References (22)

1. C. Bajaj. The algebraic complexity of shortest paths in polyhedral spaces. In Proc. 23rd Allerton Conf. Commun. Control Comput., pages 510-517, 1985.
2. C. Bajaj. The algebraic degree of geometric optimization problems. Discrete Comput. Geom., 3:177-191, 1988.
3. J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pages 49-60, 1987.
4. J. Chen and Y. Han. Shortest paths on a polyhedron. Internat. J. Comput. Geom. Appl, 6:127-144, 1996.
5. J. Choi, J. Sellen, and C.-K. Yap. Precision-sensitive Euclidean shortest path in 3-space. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 350-359, 1995.
6. J. Choi, J. Sellen, and C. K. Yap. Approximate Euclidean shortest paths in 3-space. Internat. J. Comput. Geom. Appl., 7(4):271-295, Aug. 1997.
7. J. Choi and C.-K. Yap. Monotonicity of rectilinear geodesics in d-space. In Proc. 12th Annu. ACM Sympos. Comput., Geom., pages 339-348, 1996.
8. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 19th Annu. ACM Sympos. Theory Comput., pages 56-65, 1987.
9. K. L. Clarkson, S. Kapoor, and P. M. Vaidya. Rectilinear shortest paths through polygonal obstacles in O(n(log n)2) time. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 251-257, 1987.
10. M. de Berg, M. van Kreveld, and B. J. Nilsson. Shortest path queries in rectilinear worlds of higher dimension. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 51-60, 1991.
11. M. Dror, A. Efrat, A. Lubiw, and J. S. B. Mitchell. Touring a sequence of polygons. In 35th ACM Sympos. Theory of Computing, pages 473-482, 2003.
12. L. Gewali, S. Ntafos, and I. G. Tollis. Path planning in the presence of vertical obstacles. Technical report, Computer Science, University of Texas at Dallas, 1989.
13. S. Har-Peled. Constructing approximate shortest path maps in three dimensions. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 383-391, 1998.
14. J. Hershberger and S. Suri. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput., 28(6):2215-2256, 1999.
15. S. Kapoor. Efficient computation of geodesic shortest paths. In Proc. 31st Annu. ACM Sympos. Theory Comput., pages 770-779, 1999.
16. J. S. B. Mitchell. An optimal algorithm for shortest rectilinear paths among obstacles. In Abstracts 1st Canad. Conf. Comput. Geom., page 22, 1989.
17. 1 shortest paths among polygonal obstacles in the plane. Algorithmica, 8:55-88, 1992.
18. J. S. B. Mitchell. Shortest paths and networks. In J. E. Good-man and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 24, pages 445-466. CRC Press, 1997.
19. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, eds, Handbook of Computational Geometry, pages 633-701. Elsevier Science Publishers, 2000.
20. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16:647-668, 1987.
21. C. H. Papadimitriou. An algorithm for shortest-path motion in three dimensions. Inform. Process. Lett., 20:259-263, 1985.
22. M. Sharir. On shortest paths amidst convex polyhedra. SIAM J. Comput., 16:561-572, 1987.