Approximate Euclidean shortest paths amid convex obstacles

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 283-292

  Agarwal, Pankaj K ^a   Sharathkumar, R ^a   Yu, Hai ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

ALGORITHMS AND DATA STRUCTURES; CORE SET; EUCLIDEAN SHORTEST PATH; QUERY TIME; RUNNING TIME; SHORTEST PATH;

GRAPH THEORY;

EID: 70349098766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.32     Document Type: Conference Paper

References (25)

1. P. K. Agarwal, B. Aronov, and S. Suri. Stabbing triangulations by lines in 3d. In Proc. 11th Annu. Sympos. Comput. Geom., pages 267-276, 1995.
2. P. K. Agarwal, S. Har-Peled, and M. Karia. Computing approximate shortest paths on convex polytopes. In Algorithmica, 33:227-242, 2002.
3. P. K. Agarwal, S. Har-peled, M. Sharir, and K. R. Varadarajan. Approximating shortest paths on a convex polytope in three dimensions. J. ACM, 44:567-584, 1997.
4. Lyudinil Aleksandrov, Anil Maheshwari, and Jörg-Rüdiger Sack. Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM, 52(1):25-53, 2005. (Pubitemid 43078380)
5. T. Asano, D. G. Kirkpatrick, and C. Yap. Pseudo approximation algorithms with applications to optimal motion planning. Discrete Comput Geom., 31:139-171, 2004.
6. J. Canny and J. Reif. New lower bound techniques for robot motion planning problems. In Proc. 28th IEEE Sympos. Foundat Comput Sci., pages 49-60, 1987. (Pubitemid 18538580)
7. B. Chazelle and N. Shouraboura. Bounds on the size of tetrahedralizations. Discrete Comput Geom., 14:429-444, 1995.
8. J. Chen and Y. Han. Shortest paths on a polyhedron, Part 1: Computing shortest paths. Internat J. Comput. Geom. Appl., 6:127-144, 1996.
9. J. Choi, J. Sellen, and C.-K. Yap. Approximate Euclidean shortest paths in 3-space. Internat J. Comput Geom. Appl., 7:271-295, 1997.
10. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc 19th Annu. ACM Sympos. Theory Comput., pages 56-65, 1987. (Pubitemid 18643391)
11. K. Dudley. Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory, 10:227-236, 1974.
12. S. Har-Peled. Approximate shortest-path and geodesic diameter on convex polytopes in three dimensions. Discrete Comput Geom., 21:216-231, 1999.
13. S. Har-Peled. Constructing approximate shortest path maps in three dimensions. SIAM J. Comput., 28:1182-1197, 1999.
14. J. Hershberger and S. Suri. Practical methods for approximating shortest path on a convex polytope in R3. Comput. Geom. Theory Appl., 10:31-46, 1998.
15. J. Hershberger and S. Suri. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput., 28:2215-2256, 1999.
16. J. Mitchell. Shortest paths and networks. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 755-778. CRC Press, Inc., Boca Raton, FL, USA, 1997.
17. J. Mitchell and M. Sharir. New results on shortest paths in three dimensions. In Proc. 20th Annu. Sympos. Comput. Geom., pages 124-133, 2004.
18. J.S.B. Mitchell, D. Mount, and C. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16:647-668, 1987.
19. C. Papadimitriou. An algorithm for shortest path motion planning in three dimension. Inform. Process. Lett., 20:259-268, 1985.
20. A. Pogorelov. Extrinsic Geometry of Convex Surfaces, volume 35 of Transactions of Mathematical Monographs. American Mathematical Society, Providence, RI, 1973.
21. F. Preparata and R. Tamassia. Efficient point location in a convex spatial cell-complex. SIAM J. Comput., 21:267-280, 1992.
22. J. Reif and J. Storer. A single-exponential upper bound for finding shortest paths in three dimensions. J. ACM, 41:1013-1019, 1994.
23. Y. Schreiber and M. Sharir. An optimal algorithm for shortest paths on a convex polytope in three dimensions. Discrete Comput. Geom., 39:500-579, 2008.
24. M. Sharir. On shortest paths amidst convex polyhedra. SIAM J. Comput., 16:561-572, 1987.
25. M. Sharir and A. Schorr. On shortest paths in polyhedral spaces. SIAM J. Comput., 15:193-215, 1986.