The Metro Map Layout Problem

Hong, Seok-Hee and Merrick, Damian and Do Nascimento, Hugo A. D. (2004) The Metro Map Layout Problem. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 482-491(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_50).

Full text not available from this repository.

Abstract

We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce such layouts automatically. Our method uses a variation of the spring algorithm with a suitable preprocessing step. The experimental results with real world data sets show that our method produces good metro map layouts quickly. A preliminary version of this paper was published in [5]. For a version of this paper with full-size colour images, see [6].

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-31843-9_50
Classifications: J Applications > J.999 Others
M Methods > M.400 Force-directed / Energy-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/620

Actions (login required)

View Item View Item