An improved approximation algorithm for computing geometric shortest paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 246-257

  Aleksandrov, Lyudmil ^a   Maheshwari, Anil ^b   Sack, Jörg Rüdiger ^b  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COSTS; GRAPH THEORY;

DISCRETIZATIONS; EUCLIDEAN DISTANCE; GEOMETRIC GRAPHS; GREEDY APPROACHES; POLYHEDRAL SURFACE; SHORTEST PATH; SHORTEST PATH PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 33748078185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_23     Document Type: Article

References (17)

1. K.R. Varadarajan and P.K. Agarwal, "Approximating Shortest Paths on Nonconvex Polyhedron", SIAM Jl. Comput. 30(4): 1321-1340 (2000).
2. P.K. Agarwal, S. Har-Peled, and M. Karia, "Computing approximate shortest paths on convex polytopes", Algorithmica 33:227-242, 2002.
3. P.K. Agarwal et al., "Approximating Shortest Paths on a Convex Polytope in Three Dimensions", Jl. ACM 44:567-584, 1997.
4. L. Aleksandrov, M. Lanthier, A. Maheshwari, J.-R. Sack, "An ε-approximation algorithm for weighted shortest paths", SWAT, LNCS 1432:11-22, 1998.
5. L. Aleksandrov, A. Maheshwari, and J.-R. Sack, "Approximation Algorithms for Geometric Shortest Path Problems", 32nd STOC, 2000, pp. 286-295.
6. J. Canny and J. H. Reif, "New Lower Bound Techniques for Robot Motion Planning Problems", 28th FOCS, 1987, pp. 49-60.
7. J. Chen and Y. Han, "Shortest Paths on a Polyhedron", 6th SoACM-CG, 1990, pp. 360-369.
8. Appeared in "Internat. J. Comput. Geom. Appl.", 6: 127-144, 1996.
9. 3n, 6SODA, 1995, pp. 447-456.
10. S. Kapoor, "Efficient Computation of Geodesic Shortest Paths", 31st STOC, 1999.
11. M. Lanthier, A. Maheshwari and J.-R. Sack, "Approximating Weighted Shortest Paths on Polyhedral Surfaces", Algorithmica 30(4): 527-562 (2001).
12. J.S.B. Mitchell, D.M. Mount and C.H. Papadimitriou, "The Discrete Geodesic Problem", SIAM Jl. Computing, 16:647-668, August 1987.
13. J.S.B. Mitchell and C.H. Papadimitriou, "The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision", JACM, 38:18-73, 1991.
14. C.H. Papadimitriou, "An Algorithm for Shortest Path Motion in Three Dimensions", IPL, 20, 1985, pp. 259-263.
15. M. Sharir and A. Schorr, "On Shortest Paths in Polyhedral Spaces", SIAM J. of Comp., 15, 1986, pp. 193-215.
16. Z. Sun and J. Reif, "BUSHWACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces", 12th ISAAC, LNCS 2223:160-171, 2001.
17. M. Ziegelmann, Constrained Shortest Paths and Related Problems Ph.D. thesis, Universität des Saarlandes (Max-Planck Institut für Informatik), 2001.