Quickest Path Queries on Transportation Network

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.

Provided by: Lund University Topic: Security Date Added: Jan 2011 Format: PDF

Download Now

Find By Topic