An ϵ - Approximation algorithm for weighted shortest paths on polyhedral surfaces

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

Volumn 1432, Issue , 1998, Pages 11-22

  Aleksandrov, Lyudmil ^a   Lanthier, Mark ^b   Maheshwari, Anil ^b   Sack, Jörg R ^b  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GEOMETRY; GRAPH THEORY;

APPROXIMATION FACTOR; EXACT CONSTANTS; MINIMUM DISTANCE; MULTIPLICATIVE FACTORS; OPTIMAL PATHS; POLYHEDRAL SURFACE; SHORTEST PATH; STEINER POINTS;

APPROXIMATION ALGORITHMS;

EID: 84957666373     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054351     Document Type: Conference Paper

References (15)

1. L. Aleksandrov, M. Lanthier, A. Maheshwari and J.-R. Sack, “An e-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces”, to appear l~th European Workshop on Computational Geometry, Barcelona, Spain, 1998.
2. J. Choi, J. Sellen and C.K. Yap, “Approximate Euclidean Shortest Path in 3- Space”, Proc. lOth Annual Symp. on Computational Geometry, 1994, pp. 41-48.
3. G. Das and G. Narasimhan, “Short Cuts in Higher Dimensional Space”, Proceedings of the 7th Annual Canadian Conference on Computational Geometry, Quebec City, Qudbec, 1995, pp. 103-108.
4. 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.
5. J. Goodman and J. O’Rourke, Eds., Handbook of Discrete and Computational Geometry, CRC Press LLC, Chapter 24, 1997, pp. 445-466.
6. P. Johansson, “On a Weighted Distance Model for Injection Molding”, Linköping Studies in Science and Technology, Thesis no. 604 LiU-TEK-LIC-1997:05, Division of Applied Mathematics, Linköping University, Linköping, Sweden, 1997.
7. C. Kenyon and R. Kenyon, “How To Take Short Cuts”, Discrete and Computational Geometry, Vol. 8, No. 3, 1992, pp. 251-264.
8. M. Lanthier, A. Maheshwari and J.-R. Sack, “Approximating Weighted Shortest Paths on Polyhedral Surfaces”, Proceedings of the 13th Annual A CM Symposium on Computational Geometry, 1997, pp. 274-283.
9. M. Lanthier, “Shortest Path Problems on Polyhedral Surfaces”, Ph.D. Thesis in progress, School of Computer Science, Carleton University, Ottawa, Canada, 1998.
10. C. Mata and J. Mitchell, “A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions”, Proceedings of the 13th Annual A CM Symposium on Computational Geometry, 1997, pp. 264-273.
11. 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.
12. C.H. Papadimitriou, “An Algorithm for Shortest Path Motion in Three Dimensions”, Information Processing Letters, 20, 1985, pp. 259-263.
13. J.-R. Sack and J. Urrutia Eds., Handbook on Computational Geometry, Elsevier Science B.V., to appear.
14. M. Sharir and A. Schorr, “On Shortest Paths in Polyhedral Spaces”, SIAM Journal of Computing, 15, 1986, pp. 193-215.
15. Paradigm Group Webpage, School of Computer Science, Carleton University, http://www.scs.carleton.ca/~ gis.