An Algorithmic Framework for Labeling Network Maps

Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro maps. We present a flexible and versatile labeling model. Despite its simplicity, we prove that it is NP-complete to label a single line of the network. For a restricted variant of that model, we introduce an efficient algorithm that optimally labels a single line. Based on that algorithm, we present a general and sophisticated workflow for multiple metro lines, which is experimentally evaluated on real-world metro maps.

[1]  Alexander Wolff,et al.  Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming , 2011, IEEE Transactions on Visualization and Computer Graphics.

[2]  Binhai Zhu,et al.  A polynomial time solution for labeling a rectilinear map , 1997, SCG '97.

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

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

[5]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[6]  Alexander Wolff,et al.  Labeling Subway Lines , 2001, ISAAC.

[7]  Bettina Speckmann,et al.  Topologically Safe Curved Schematisation , 2013 .

[8]  E. Imhof.  Positioning Names on Maps , 1975 .

[9]  Stephen G. Walker,et al.  Automatic Metro Map Layout Using Multicriteria Optimization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[10]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[11]  Jan-Henrik Haunert,et al.  An Algorithmic Framework for Labeling Network Maps , 2017, Algorithmica.

[12]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[13]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[14]  Ioannis G. Tollis,et al.  A unified approach to labeling graphical features , 1998, SCG '98.

[15]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

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

[17]  Ming-Te Chi,et al.  Focus+Context Metro Maps , 2011, IEEE Transactions on Visualization and Computer Graphics.

[18]  Alexander Wolff,et al.  Graph Drawing and Cartography , 2013, Handbook of Graph Drawing and Visualization.

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

[20]  Joe Marks,et al.  An empirical study of algorithms for point-feature label placement , 1995, TOGS.

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