Shortest anisotropic paths on terrains

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

Volumn 1644 LNCS, Issue , 1999, Pages 524-533

  Lanthier, Mark ^a   Maheshwari, Anil ^a   Sack, Jörg Rüdiger ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

An iositropic paths; Approximation; Computational geometry; Shortest path

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

AN- IOSITROPIC PATHS; APPROXIMATION; EUCLIDEAN SHORTEST PATH; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SHORTEST PATH; TIME ALGORITHMS;

ANISOTROPY;

EID: 84887422667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_49     Document Type: Conference Paper

References (13)

1. L. Aleksandrov, M. Lanthier, A. Maheshwari and J.-R. Sack, "An ε-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces", 14th European Workshop on Computational Geometry, Barcelona, Spain, 1998.
2. L. Aleksandrov, M. Lanthier, A. Maheshwari and J.-R. Sack, "An ε -Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces", SWAT '98, LNCS 1432, Stockholm, Sweden, 1998, pp. 11-22.
3. J. Choi, J. Sellen and C.K. Yap, "Approximate Euclidean Shortest Path in 3- Space", Proc. 10th Annual Symp. on Computational Geometry, 1994, pp. 41-48.
4. G. Das and G. Narasimhan, "Short Cuts in Higher Dimensional Space", Proceedings of the 7th Annual Canadian Conference on Computational Geometry, Quebec City, Quebec, 1995, pp. 103-108.
5. C. Kenyon and R. Kenyon, "How To Take Short Cuts", Discrete and Computational Geometry, Vol. 8, No. 3, 1992, pp. 251-264.
6. M. Lanthier, A. Maheshwari and J.-R. Sack, "Approximating Weighted Shortest Paths on Polyhedral Surfaces", Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 274-283.
7. C. Mata and J. Mitchell, "A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions", Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 264-273.
8. 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.
9. J.S.B. Mitchell, "Geometric Shortest Paths and Network Optimization", in J.-R. Sack and J. Urrutia Eds., Handbook on Computational Geometry, Elsevier Science B.V., to appear 1999.
10. N.C. Rowe, and R.S. Ross, "Optimal Grid-Free Path Planning Across Arbitrarily Contoured Terrain with Anisotropic Friction and Gravity Effects", IEEE Transactions on Robotics and Automation, Vol. 6, No. 5, October 1990, pp. 540-553.
11. M. Sharir and A. Schorr, "On Shortest Paths in Polyhedral Spaces", SIAM Journal of Computing, 15, 1986, pp. 193-215.
12. R. Tamassia et al., "Strategic Directions in Computational Geometry", ACM Computing Surveys, Vol. 28, No. 4, December 1996.
13. Paradigm Group Webpage, School of Computer Science, Carleton University, http://www.scs.carleton.ca/gis.