Shortest Path in Transportation Network and Weighted Subdivisions

Abstract

The shortest path problem asks for a path between two given points such that the sum of its edges is minimized. The problem has a rich history and has been studied extensively since the 1950’s in many areas of computer science, among them network optimization, graph theory and computational geometry. 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.