Efficient generation of geographically accurate transit maps

We present LOOM (Line-Ordering Optimized Maps), a fully automatic generator of geographically accurate transit maps. The input to LOOM is data about the lines of a given transit network, namely for each line, the sequence of stations it serves and the geographical course the vehicles of this line take. We parse this data from GTFS, the prevailing standard for public transit data. LOOM proceeds in three stages: (1) construct a so-called line graph, where edges correspond to segments of the network with the same set of lines following the same course; (2) construct an ILP that yields a line ordering for each edge which minimizes the total number of line crossings and line separations; (3) based on the line graph and the ILP solution, draw the map. As a naive ILP formulation is too demanding, we derive a new custom-tailored formulation which requires significantly fewer constraints. Furthermore, we present engineering techniques which use structural properties of the line graph to further reduce the ILP size. For the subway network of New York, we can reduce the number of constraints from 229,000 in the naive ILP formulation to about 3,700 with our techniques, enabling solution times of less than a second. Since our maps respect the geography of the transit network, they can be used for tiles and overlays in typical map services. Previous research work either did not take the geographical course of the lines into account, or was concerned with schematic maps without optimizing line crossings or line separations.

[1]  Seok-Hee Hong,et al.  Automatic visualisation of metro maps , 2006, J. Vis. Lang. Comput..

[2]  Alexander Wolff,et al.  Drawing Metro Maps Using Bézier Curves , 2012, GD.

[3]  Joachim Gudmundsson,et al.  An ILP for the metro-line crossing problem , 2008, CATS.

[4]  Alexander Wolff,et al.  Ordering Metro Lines by Block Crossings , 2015, J. Graph Algorithms Appl..

[5]  Michael A. Bekos,et al.  Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem , 2009, GD.

[6]  Dieter Pfoser,et al.  A comparison and evaluation of map construction algorithms using vehicle tracking data , 2014, GeoInformatica.

[7]  Martin Nöllenburg,et al.  A Survey on Automated Metro Map Layout Methods , 2012 .

[8]  M. Ahmed,et al.  A Comparison and Evaluation of Map Construction Algorithms , 2014, ArXiv.

[9]  Martin Fink,et al.  Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases , 2013, GD.

[10]  Michael A. Bekos,et al.  On Metro-Line Crossing Minimization , 2010, J. Graph Algorithms Appl..

[11]  Alexander Wolff,et al.  Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps , 2006, Graph Drawing.

[12]  Jarke J. van Wijk,et al.  Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.

[13]  Carola Wenk,et al.  Constructing Street Networks from GPS Trajectories , 2012, ESA.

[14]  Martin Nöllenburg,et al.  An Improved Algorithm for the Metro-line Crossing Minimization Problem , 2009, GD.

[15]  Sergey Bereg,et al.  Edge Routing with Ordered Bundles , 2011, Graph Drawing.

[16]  Michael A. Bekos,et al.  Line Crossing Minimization on Metro Maps , 2007, Graph Drawing.