The metro map layout problem

Authors:
Seok-Hee Hong;Damian Merrick;Hugo A. D. do Nascimento
Affiliations:
University of Sydney, Australia;University of Sydney, Australia;Instituto de Informatica-UFG, Brazil
Venue:
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
Year:
2004

Citing 5
Cited 5

The solution of large 0–1 integer programming problems encountered in automated cartography

Operations Research
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
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
A Fast Adaptive Layout Algorithm for Undirected Graphs

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
User hints for map labelling

ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Graph Drawing
Automatic visualisation of metro maps

Journal of Visual Languages and Computing
Line crossing minimization on metro maps

GD'07 Proceedings of the 15th international conference on Graph drawing
The metro map layout problem

GD'04 Proceedings of the 12th international conference on Graph Drawing
More flexible radial layout

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address 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 present a method to produce a good layout of a metro map 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 approach is promising.