Shortest-Paths Preserving Metro Maps

Milea, Tal and Schrijvers, Okke and Buchin, Kevin and Haverkort, Herman (2012) Shortest-Paths Preserving Metro Maps. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 445-446(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_45).

Full text not available from this repository.

Abstract

A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use the geographical embedding of the system, but rather a representation where the relevant information is presented as clearly as possible. There are several algorithms that aim to generate such maps.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-25878-7_45
Classifications: P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1280

Actions (login required)

View Item View Item