Abstract
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 that subsumes different labeling styles. We show that labeling a single line of the network is NP-hard, even if we make very restricting requirements about the labeling style that is used with this model. For a restricted variant of that model, we then introduce an efficient algorithm that optimally labels a single line with respect to a given cost function. Based on that algorithm, we present a general and sophisticated workflow for multiple metro lines, which is experimentally evaluated on real-world metro maps.
Similar content being viewed by others
References
Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl. 11(3–4), 209–218 (1998)
Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
Christensen, J., Marks, J., Shieber, S.: An empirical study of algorithms for point-feature label placement. Am. Cartogr. 14(3), 203–232 (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Fink, M., Haverkort, H., Nöllenburg, M., Roberts, M., Schuhmann, J., Wolff, A.: Drawing metro maps using bézier curves. In: Graph Drawing (GD’13), Volume 7704 of Lecture Notes in Computer Science, pp. 463–474. Springer (2013)
Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Computational Geometry (SoCG’91), pp. 281–288. ACM Press (1991)
Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133–137 (1981)
Garrido, M., Iturriaga, C., Márquez, A., Portillo, J., Reyes, P., Wolff, A.: Labeling subway lines. In: Algorithms and Computation (ISAAC’01), Volume 2223 of Lecture Notes in Computer Science, pp. 649–659. Springer, Berlin (2001)
Imhof, E.: Positioning names on maps. Am. Cartogr. 2(2), 128–144 (1975)
Kakoulis, K.G., Tollis, I.G.: A unified approach to labeling graphical features. In: Computational Geometry (SoCG’98), pp. 347–356. ACM Press (1998)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)
Nöllenburg, M.: An improved algorithm for the metro-line crossing minimization problem. In: Graph Drawing (GD’09), Volume 5849 of Lecture Notes in Computer Science, pp. 381–392. Springer, Berlin (2010)
Nöllenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comput. Gr. 17(5), 626–641 (2011)
Poon, C.K., Zhu, B., Chin, F.: A polynomial time solution for labeling a rectilinear map. In: Computational Geometry (SoCG’97), pp. 451–453. ACM (1997)
Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edge routing with ordered bundles. Comput. Geom. Theory Appl. 52, 18–33 (2016)
Stott, J., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Trans. Vis. Comput. Gr. 17(1), 101–114 (2011)
van Goethem, A., Meulemans, W., Reimer, A., Haverkort, H., Speckmann, B.: Topologically safe curved schematisation. Cartogr. J. 50(3), 276–285 (2013)
Wang, Y.-S., Chi, M.-T.: Focus+context metro maps. IEEE Trans. Vis. Comput. Gr. 17(12), 2528–2535 (2011)
Wolff, A. Graph drawing and cartography. In: Handbook of Graph Drawing and Visualization, chapter 23, pp. 697–736. Chapman and Hall (2013)
Acknowledgements
We sincerely thank Herman Haverkort, Arlind Nocaj, Aidan Slingsby and Jo Wood for helpful and interesting discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper has appeared in Proc. 21st Int. Conf. on Computing Combinatorics (COCOON’15), volume 9198 of Lect. Notes Comput. Sci., pages 689–700, Springer-Verlag. This research was initiated during Dagstuhl Seminar 13151 “Drawing Graphs and Maps with Curves” in April 2013.
Rights and permissions
About this article
Cite this article
Niedermann, B., Haunert, JH. An Algorithmic Framework for Labeling Network Maps. Algorithmica 80, 1493–1533 (2018). https://doi.org/10.1007/s00453-017-0350-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-017-0350-0