On Metro-Line Crossing Minimization

We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V;E) so that the total number of crossings among pairs of paths is minimized. This problem arises when drawing metro maps, where the embedding of G depicts the structure of the underlying network, the nodes of G correspond to train stations, an edge connecting two nodes implies that there exists a railway track connecting them, whereas the paths illustrate the metro lines connecting terminal stations. We call this the metro-line crossing minimization problem (MLCM). We examine several variations of the problem for which we develop algorithms that yield optimal solutions.

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

[2]  Steven Zoraster,et al.  The Solution of Large 0-1 Integer Programming Problems Encountered in Automated Cartography , 1990, Oper. Res..

[3]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[4]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[5]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[6]  Steven Zoraster,et al.  Practical Results Using Simulated Annealing for Point Feature Label Placement , 1997 .

[7]  Sumio Masuda,et al.  Crossing Minimization in Linear Embeddings of Graphs , 1990, IEEE Trans. Computers.

[8]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[9]  Alexander Wolff,et al.  A Mixed-Integer Program for Drawing High-Quality Metro Maps , 2005, GD.

[10]  Peter Rodgers,et al.  Metro map layout using multicriteria optimization , 2004, Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004..

[11]  Alexander Wolff,et al.  Point labeling with sliding labels , 1999, Comput. Geom..

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

[13]  Seok-Hee Hong,et al.  The Metro Map Layout Problem , 2004, InVis.au.

[14]  Alexander Wolff,et al.  Labeling Points with Weights , 2001, Algorithmica.

[15]  Joachim Gudmundsson,et al.  Path Simplification for Metro Map Layout , 2006, Graph Drawing.

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

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Ioannis G. Tollis,et al.  On the Edge Label Placement Problem , 1996, GD.

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