A metro map metaphor for guided tours on the Web: the Webvise guided tour system
Proceedings of the 10th international conference on World Wide Web
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Metro Map Layout Using Multicriteria Optimization
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visual access to city websites: A challenge for PDA's GUI
Journal of Visual Languages and Computing
An ILP for the metro-line crossing problem
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A zone-based approach for placing annotation labels on metro maps
SG'11 Proceedings of the 11th international conference on Smart graphics
A new force-directed graph drawing method based on edge-edge repulsion
Journal of Visual Languages and Computing
An improved algorithm for the metro-line crossing minimization problem
GD'09 Proceedings of the 17th international conference on Graph Drawing
International Journal of Human-Computer Studies
Drawing metro maps using bézier curves
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
We investigate the 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.