Affiliation:
1. National ICT Australia (NICTA), University of Sydney, Australia
Abstract
In this chapter we consider two versions of the problem; the shortest path in a transportation network and the shortest path in a weighted subdivision, sometimes called a terrain.
Reference30 articles.
1. Voronoi Diagram for services neighboring a highway
2. Quickest Paths, Straight Skeletons, and the City Voronoi Diagram
3. Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
4. Aleksandrov, L., Lanthier, M., Maheshwari, A., & Sack, J.-R. (1998). An epsilon-approximation algorithm for weighted shortest paths on polyhedral surfaces. In Proceedings of the 6th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science 1432.
5. Aleksandrov, L., Lanthier, M., Maheshwari, A., & Sack, J.-R. (2003). An improved approximation algorithm for computing geometric shortest paths. In Proceedings of the 14th International Symposium on Fundamentals of Computation Theory. Lecture Notes in Computer Science 2751.