This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists of a planar network where each road (edge) has an individual speed. A traveler may enter and exit the network at any point on the roads. Along any road the traveler moves with a fixed speed depending on the road, and outside the network the traveler moves at unit speed in any direction. We give an exact algorithm for the basic version of the quickest path problem: given a transportation network with n edges in the Euclidean plane, a source point s R2and a destination point t R2, find the quickest path between s and t. We also show how the transportation network can be preprocessed in time O (n2 logn) into a data structure of size O (n2/E2) such that (1+E)-approximate quickest path cost queries between any two points in the plane can be answered in time O (1=E4 logn).
Cite as: Shawi, R. E., Gudmudsson, J. and Levcopoulos, C. (2012). Quickest Path Queries on Transportation Network. In Proc. Computing: The Australasian Theory Symposium (CATS 2012) Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 37-46
(from crpit.com)
(local if available)