The metro map layout problem

  • Authors:
  • Seok-Hee Hong;Damian Merrick;Hugo A. D. do Nascimento

  • Affiliations:
  • National ICT Australia School of Information Technologies, University of Sydney, Australia;National ICT Australia School of Information Technologies, University of Sydney, Australia;Instituto de Informatica-UFG, Brazil

  • Venue:
  • GD'04 Proceedings of the 12th international conference on Graph Drawing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.