Approximation algorithms for geometric shortest path problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 286-295

  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

ARBITRARY CONSTANTS; CONVEX FACES; GEOMETRIC CONFIGURATIONS; GEOMETRIC PROBLEMS; POLYHEDRAL SURFACE; SHORTEST PATH; SHORTEST PATH PROBLEM; WEIGHTED SUM;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; COSTS; GEOMETRY; SURFACE PLASMON RESONANCE; ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS;

GRAPH THEORY; COMPUTATIONAL GEOMETRY;

APPROXIMATION ALGORITHMS; SHORTEST PATH PROBLEMS;

EID: 0033689289     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335339     Document Type: Conference Paper

References (23)

1. K.R. Varadarajan and P.K. Agarwal, "Approximating Shortest Paths on a Polyhedron",38FOCS,1997.
2. L. Aleksandrov, M.Lanthier, A. Maheshwari, J.-R. Sack, "An ε-Approximation Algorithm for Weighted Shortest Paths", Proc. SWAT, Stockholm, LNCS 1432, July 1998, pp. 11-22.
3. L. Aleksandrov, A. Maheshwari and J.-R. Sack, "Approximation Algorithms for Geometric Shortest Path Problems", technical report, School of Compter Science, TR-99-10, October 1999.
4. C. Bajaj and T. Dey, "Convex decompositions of polyhedra and robustness", SIAM Jl. Comput. 21, 1992, pp. 339-364.
5. J. Canny and J. H. Reif, "New Lower Bound Techniques for Robot Motion Planning Problems",28th IEEE Symp. on Foundations of Computer Science, 1987, pp. 49-60.
6. J. Chen and Y. Han, "Shortest Paths on a Polyhedron", 6th SoACM-CG, 1990, pp. 360-369.
7. K.L. Clarkson, "Approximation algorithms for shortest path motion planning", 19 ACM Symposium on Theory of Computing, 1987, pp. 56-65.
8. J. Choi, J. Sellen and C.K. Yap, "Approximate Euclidean Shortest Path in 3-Space", 10 SoACM-CG, 1994, pp. 41-48.
9. J. Choi, J. Sellen and C.K. Yap, "Approximate Euclidean Shortest Path in 3-Space", Intl. Jl. of Computational Geometry and Applications,Vol. 7, no. 4, 1997, pp. 271-295. (Pubitemid 127528035)
10. G. Das and G. Narasimhan, "Short Cuts in Higher Dimensional Space", Proceedings of the 7th Annual Canadian Conference on Computational Geometry, Québec City, Québec, 1995, pp. 103-108.
11. T. Dey, "personal communication", March 1999.
12. E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs", Numerical Mathematics 1, 1959, pp.269-271.
13. M.L. Fredman and R.E. Tarjan, "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms", J. ACM, 34(3), 1987, pp.596-615.
14. J. Hershberger and J. Snoeyink, "Erased arrangements of lines and convex decompositions of polyhedra", CGTA 9, 1998, pp. 129-143. (Pubitemid 128378351)
15. S. Kapoor, "Efficiently computing geodesic shortest paths", 1999 ACM Symposium on Theory of Computing.
16. C. Kenyon and R. Kenyon, "How To Take Short Cuts", Discrete and Computational Geometry, Vol. 8, 1992, pp. 251-264.
17. M. Lanthier, A. Maheshwari and J.-R. Sack, "Approximating Weighted Shortest Paths on Polyhedral Surfaces", 13 SoACM-CG, 1997, pp. 274-283. (to appear in Algorithmica)
18. M. Lanthier, "Shortest Path Problems on Polyhedral Surfaces", Ph.D. Thesis, School of Computer Science, Carleton University, Ottawa, Canada, 2000.
19. M. Lanthier, A. Maheshwari, and J.-R. Sack, "Shortest Anisotropic Paths on Terrains", in Proc. ICALP'99, Prague, LNCS 1644, pp. 524-533, 1999.
20. C. Mata and J. Mitchell, "A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions", 13 SoACM-CG, 1997, pp. 264-273.
21. J.S.B. Mitchell and C.H. Papadimitriou, "The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision", Journal of the ACM, 38, January 1991, pp. 18-73.
22. C.H. Papadimitriou, "An Algorithm for Shortest Path Motion in Three Dimensions", IPL, 20, 1985, pp. 259-263.
23. M. Sharir, "On Shortest Paths Amidst Convex Polyhedra", SIAM Jl. Comp., 16, 1987, pp. 561-572. (Pubitemid 17583636)