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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Hong, S. H., Merrick, D., & Do Nascimento, H. A. D. (2004). The metro map layout problem. In Lecture Notes in Computer Science (Vol. 3383, pp. 482–491). https://doi.org/10.1007/978-3-540-31843-9_50
Mendeley helps you to discover research relevant for your work.