On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
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
Schematization of road networks
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Schematizing Maps: Simplification of Geographic Shape by Discrete Curve Evolution
Spatial Cognition II, Integrating Abstract Theories, Empirical Studies, Formal Methods, and Practical Applications
Sketch-Driven Orthogonal Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Metro Map Layout Using Multicriteria Optimization
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
GD'04 Proceedings of the 12th international conference on Graph Drawing
Increasing the readability of graph drawings with centrality-based scaling
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
An ILP for the metro-line crossing problem
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A Fast and Simple Heuristic for Metro Map Path Simplification
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Génération et placement de couleurs sur une vue de type métro
Proceedings of the 21st International Conference on Association Francophone d'Interaction Homme-Machine
Schematisation of tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Path simplification for metro map layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Minimizing intra-edge crossings in wiring diagrams and public transportation maps
GD'06 Proceedings of the 14th international conference on Graph drawing
Line crossing minimization on metro maps
GD'07 Proceedings of the 15th international conference on Graph drawing
Proceedings of the International Conference on Advanced Visual Interfaces
Area-preserving subdivision schematization
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Homotopic rectilinear routing with few links and thick edges
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
An improved algorithm for the metro-line crossing minimization problem
GD'09 Proceedings of the 17th international conference on Graph Drawing
Time-Space maps from triangulations
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g. the physical location of the tracks and stations of a metro system) and a set ${\mathcal L}$of paths or cycles in G (e.g. metro lines), draw G and ${\mathcal L}$nicely. We first specify the niceness of a drawing by listing a number of hard and soft constraints. Then we present a mixed-integer program (MIP) which always finds a drawing that fulfills all hard constraints (if such a drawing exists) and optimizes a weighted sum of costs corresponding to the soft constraints. We also describe some heuristics that speed up the MIP. We have implemented both the MIP and the heuristics. We compare their output to that of previous algorithms for drawing metro maps and to official metro maps drawn by graphic designers.