Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming

Authors:
Martin Nollenburg;Alexander Wolff
Affiliations:
Karlsruhe Institute of Technology (KIT) , Karlsruhe;Universität Würzburg, Würzburg
Venue:
IEEE Transactions on Visualization and Computer Graphics
Year:
2011

Citing 0
Cited 10

On d-regular schematization of embedded paths

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Automatic generation of route sketches

GD'10 Proceedings of the 18th international conference on Graph drawing
A zone-based approach for placing annotation labels on metro maps

SG'11 Proceedings of the 11th international conference on Smart graphics
Shortest-Paths preserving metro maps

GD'11 Proceedings of the 19th international conference on Graph Drawing
Travel-Route-Centered Metro Map Layout and Annotation

Computer Graphics Forum
Objective versus subjective measures of Paris Metro map usability: Investigating traditional octolinear versus all-curves schematics

International Journal of Human-Computer Studies
Homotopic C -oriented routing

GD'12 Proceedings of the 20th international conference on Graph Drawing
Drawing metro maps using bézier curves

GD'12 Proceedings of the 20th international conference on Graph Drawing
On d-regular schematization of embedded paths

Computational Geometry: Theory and Applications
Spatially efficient design of annotated metro maps

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automatically draw appealing metro maps. There are two aspects to this problem that depend on each other: the layout problem of finding station and link coordinates and the labeling problem of placing nonoverlapping station labels. In this paper, we present a new integral approach that solves the combined layout and labeling problem (each of which, independently, is known to be NP-hard) using mixed-integer programming (MIP). We identify seven design rules used in most real-world metro maps. We split these rules into hard and soft constraints and translate them into an MIP model. Our MIP formulation finds a metro map that satisfies all hard constraints (if such a drawing exists) and minimizes a weighted sum of costs that correspond to the soft constraints. We have implemented the MIP model and present a case study and the results of an expert assessment to evaluate the performance of our approach in comparison to both manually designed official maps and results of previous layout methods.