Skip to main content

Towards Data-Driven Multilinear Metro Maps

  • Conference paper
  • First Online:
Diagrammatic Representation and Inference (Diagrams 2020)

Abstract

Traditionally, most schematic metro maps as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and \(45^\circ \)-diagonal edges. Despite growing interest in more general multilinear metro maps, generic algorithms to draw metro maps based on a system of \(k \ge 2\) not necessarily equidistant slopes have not been investigated thoroughly. We present and implement an adaptation of the octolinear mixed-integer linear programming approach of Nöllenburg and Wolff (2011) that can draw metro maps schematized to any set \(\mathcal {C}\) of arbitrary orientations. We further present a data-driven approach to determine a suitable set \(\mathcal {C}\) by either detecting the best rotation of an equidistant orientation system or by clustering the input edge orientations using a k-means algorithm. We demonstrate the new possibilities of our method in a real-world case study.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    \(f_1\) emphasizes line straightness, \(f_2\) the topographicity and \(f_3\) compactness of an optimal layout.

References

  1. Buchin, K., Meulemans, W., van Renssen, A., Speckmann, B.: Area-preserving simplification and schematization of polygonal subdivisions. ACM Trans. Spatial Algorithms Syst. 2(1), 2:1–2:36 (2016)

    Article  Google Scholar 

  2. Delling, D., Gemsa, A., Nöllenburg, M., Pajor, T., Rutter, I.: On d-regular schematization of embedded paths. Comput. Geom. Theory Appl. 47(3A), 381–406 (2014)

    Article  MathSciNet  Google Scholar 

  3. Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, chap. 7, pp. 223–246. CRC Press, Boca Raton (2013)

    Google Scholar 

  4. Garland, K.: Mr Beck’s Underground Map. Capital Transport Publishing, Middlesex (1994)

    Google Scholar 

  5. Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258–269. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70904-6_26

    Chapter  Google Scholar 

  6. Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 13–24. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48447-7_2

    Chapter  Google Scholar 

  7. Nickel, S., Nöllenburg, M.: Towards data-driven multilinear metro maps. CoRR abs/1904.03039 (2019). https://arxiv.org/abs/1904.03039

  8. Nielsen, F., Nock, R.: Optimal interval clustering: application to bregman clustering and statistical mixture learning. IEEE Signal Process. Lett. 21(10), 1289–1292 (2014)

    Article  Google Scholar 

  9. Nöllenburg, M.: A survey on automated metro map layout methods. In: 1st Schematic Mapping Workshop, Essex, UK (2014)

    Google Scholar 

  10. Nöllenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comput. Graph. 17(5), 626–641 (2011)

    Article  Google Scholar 

  11. Roberts, M.J.: What’s your theory of effective schematic map design? In: 1st Schematic Mapping Workshop, Essex, UK (2014)

    Google Scholar 

  12. Roberts, M.J., Gray, H., Lesnik, J.: Preference versus performance: Investigating the dissociation between objective measures and subjective ratings of usability for schematic metro maps and intuitive theories of design. Int. J. Hum. Comput. Stud. 98, 109–128 (2016)

    Google Scholar 

  13. Roberts, M.J., Newton, E.J., Lagattolla, F.D., Hughes, S., Hasler, M.C.: Objective versus subjective measures of paris metro map usability: Investigating traditional octolinear versus all-curves schematics. Int. J. Hum. Comput. Stud. 71, 363–386 (2013)

    Article  Google Scholar 

  14. Wu, H.Y., Niedermann, B., Takahashi, S., Roberts, M.J., Nöllenburg, M.: A survey on transit map layout – from design, machine, and human perspectives. Comput. Graph. Forum 39(3), 619–646 (2020)

    Google Scholar 

  15. Wu, H.Y., Niedermann, B., Takahashi, S., Nöllenburg, M.: A survey on computing schematic network maps: The challenge to interactivity. In: 2nd Schematic Mapping Workshop, Vienna, Austria (2019)

    Google Scholar 

Download references

Acknowledgments

We thank Maxwell J. Roberts for discussions about non-standard linearity models.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Nöllenburg .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nickel, S., Nöllenburg, M. (2020). Towards Data-Driven Multilinear Metro Maps. In: Pietarinen, AV., Chapman, P., Bosveld-de Smet, L., Giardino, V., Corter, J., Linker, S. (eds) Diagrammatic Representation and Inference. Diagrams 2020. Lecture Notes in Computer Science(), vol 12169. Springer, Cham. https://doi.org/10.1007/978-3-030-54249-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-54249-8_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-54248-1

  • Online ISBN: 978-3-030-54249-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics