Hannah Bast
ABSTRACT
We present new generic methods to efficiently draw schematized metro maps for a wide variety of layouts, including octilinear, hexalinear, and orthoradial maps. The maps are drawn by mapping the input graph to a suitable grid graph. Previous work was restricted to regular octilinear grids. In this work, we investigate a variety of grids, including triangular grids and orthoradial grids. In particular, we also construct sparse grids where the local node density adapts to the input graph (e.g. octilinear Hanan grids, which we introduce in this work). For octilinear maps, this reduces the grid size by a factor of up to 5 compared to previous work, while still achieving close-to-optimal layouts. For many maps, this reduction also leads to up to 5 times faster solution times of the underlying optimization problem. We evaluate our approach on five maps. All octilinear maps can be computed in under 0.5 seconds, all hexalinear and orthoradial maps can be computed in under 2.5 seconds.
- Suchith Anand, Silvania Avelar, J Mark Ware, and Mike Jackson. 2007. Automated schematic map production using simulated annealing and gradient descent approaches. In GISRUK, Vol. 7.Google Scholar
- Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, and Antonios Symvonis. 2010. On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14, 1 (2010), 75–96.Google ScholarCross Ref
- Matthew Asquith, Joachim Gudmundsson, and Damian Merrick. 2008. An ILP for the metro-line crossing problem. In CATS 2008, Wollongong, NSW, Australia, January 22-25, 2008, Vol. 77. 49–56.Google Scholar
- Silvania Avelar and Matthias Müller. 2000. Generating topologically correct schematic maps. Technical Report. ETH Zurich.Google Scholar
- Lukas Barth, Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf. 2017. Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. In SoCG 2017, July 4-7, 2017, Brisbane, Australia, Vol. 77. 14:1–14:16.Google Scholar
- Hannah Bast, Patrick Brosi, and Sabine Storandt. 2018. Efficient generation of geographically accurate transit maps. In SIGSPATIAL 2018, Seattle, WA, USA, November 06-09, 2018. 13–22.Google ScholarDigital Library
- Hannah Bast, Patrick Brosi, and Sabine Storandt. 2019. Efficient Generation of Geographically Accurate Transit Maps. ACM Trans. Spatial Algorithms Syst. 5, 4 (2019), 25:1–25:36.Google ScholarDigital Library
- Hannah Bast, Patrick Brosi, and Sabine Storandt. 2020. Metro Maps on Octilinear Grid Graphs. Comput. Graph. Forum 39, 3 (2020), 357–367.Google ScholarCross Ref
- Michael A. Bekos, Michael Kaufmann, Katerina Potika, and Antonios Symvonis. 2007. Line Crossing Minimization on Metro Maps. In GD 2007, Sydney, Australia, September 24-26, 2007, Vol. 4875. 231–242.Google Scholar
- Marc Benkert, Martin Nöllenburg, Takeaki Uno, and Alexander Wolff. 2006. Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. In GD 2006, Karlsruhe, Germany, September 18-20, 2006, Vol. 4372. 270–281.Google Scholar
- Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, and Tycho Strijk. 2001. Schematization of road networks. In Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001. 33–39.Google ScholarDigital Library
- Daniel Chivers and Peter Rodgers. 2014. Octilinear Force-Directed Layout with Mental Map Preservation for Schematic Diagrams. In Diagrammatic Representation and Inference - 8th International Conference, Diagrams 2014, Melbourne, VIC, Australia, July 28 - August 1, 2014, Vol. 8578. 1–8.Google ScholarCross Ref
- Daniel Elroi. 1988. Designing a network line-map schematization software enhancement package. In Proc. 8th Ann. ESRI User Conference.Google Scholar
- Daniel Elroi. 1988. GIS and schematic maps: A new symbiotic relationship. In Proc. GIS/LIS, Vol. 88.Google Scholar
- Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, and Alexander Wolff. 2012. Drawing Metro Maps Using Bézier Curves. In GD 2012, Redmond, WA, USA, September 19-21, 2012. 463–474.Google Scholar
- Martin Fink and Sergey Pupyrev. 2013. Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. In GD 2013, Bordeaux, France, September 23-25, 2013, Vol. 8242. 328–339.Google ScholarDigital Library
- Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, and Alexander Wolff. 2021. Using the Metro-Map Metaphor for Drawing Hypergraphs. In SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Vol. 12607. 361–372.Google Scholar
- Maurice Hanan. 1966. On Steiner’s problem with rectilinear distance. SIAM J. Appl. Math. 14, 2 (1966), 255–265.Google ScholarDigital Library
- Seok-Hee Hong, Damian Merrick, and Hugo A. D. do Nascimento. 2004. The Metro Map Layout Problem. In GD 2004, New York, NY, USA, September 29 - October 2, 2004, Vol. 3383. 482–491.Google Scholar
- Seok-Hee Hong, Damian Merrick, and Hugo AD do Nascimento. 2006. Automatic visualisation of metro maps. Journal of Visual Languages & Computing 17, 3 (2006), 203–224.Google ScholarDigital Library
- Andrea S. LaPaugh and Ronald L. Rivest. 1978. The Subgraph Homeomorphism Problem. In STOC 1978, May 1-3, 1978, San Diego, California, USA. 40–50.Google Scholar
- Damian Merrick and Joachim Gudmundsson. 2006. Path Simplification for Metro Map Layout. In GD 2006, Karlsruhe, Germany, September 18-20, 2006, Vol. 4372. 258–269.Google Scholar
- Tal Milea, Okke Schrijvers, Kevin Buchin, and Herman J. Haverkort. 2011. Shortest-Paths Preserving Metro Maps. In GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Vol. 7034. 445–446.Google Scholar
- Gabriele Neyer. 1999. Line Simplification with Restricted Orientations. In WADS’99, Vancouver, British Columbia, Canada, Vol. 1663. 13–24.Google Scholar
- Soeren Nickel and Martin Nöllenburg. 2019. Drawing k-linear Metro Maps. CoRR abs/1904.03039(2019).Google Scholar
- Benjamin Niedermann and Ignaz Rutter. 2020. An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. In GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Vol. 12590. 235–249.Google Scholar
- Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf. 2019. Efficient Algorithms for Ortho-Radial Graph Drawing. In SoCG 2019, June 18-21, 2019, Portland, Oregon, USA, Vol. 129. 53:1–53:14.Google Scholar
- Martin Nöllenburg. 2009. An Improved Algorithm for the Metro-line Crossing Minimization Problem. In GD 2009, Chicago, IL, USA, September 22-25, 2009, Vol. 5849. 381–392.Google Scholar
- Martin Nöllenburg and Alexander Wolff. 2005. A Mixed-Integer Program for Drawing High-Quality Metro Maps. In GD 2005, Limerick, Ireland, September 12-14, 2005. 321–333.Google Scholar
- Martin Nöllenburg and Alexander Wolff. 2011. Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. IEEE Trans. Vis. Comput. Graph. 17, 5 (2011), 626–641.Google ScholarDigital Library
- Jonathan M. Stott and Peter Rodgers. 2004. Metro Map Layout Using Multicriteria Optimization. In IV 2004, 14-16 July 2004, London, UK. 355–362.Google Scholar
- Jonathan M. Stott, Peter Rodgers, Juan Carlos Martinez-Ovando, and Stephen G. Walker. 2011. Automatic Metro Map Layout Using Multicriteria Optimization. IEEE Trans. Vis. Comput. Graph. 17, 1 (2011), 101–114.Google ScholarDigital Library
- Peng Ti and Zhilin Li. 2014. Generation of schematic network maps with automated detection and enlargement of congested areas. Int. J. Geogr. Inf. Sci. 28, 3 (2014), 521–540.Google ScholarDigital Library
- Thomas C. van Dijk and Dieter Lutz. 2018. Realtime linear cartograms and metro maps. In SIGSPATIAL 2018, Seattle, WA, USA, November 06-09, 2018. 488–491.Google Scholar
- Thomas C. van Dijk, Arthur van Goethem, Jan-Henrik Haunert, Wouter Meulemans, and Bettina Speckmann. 2014. Map Schematization with Circular Arcs. In GIScience 2014, Vienna, Austria, September 24-26, 2014, Vol. 8728. 1–17.Google ScholarCross Ref
- J. Mark Ware, George E. Taylor, Suchith Anand, and Nathan Thomas. 2006. Automated Production of Schematic Maps for Mobile Applications. Trans. GIS 10, 1 (2006), 25–42.Google ScholarCross Ref
- Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Maxwell J. Roberts, and Martin Nöllenburg. 2020. A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives. Comput. Graph. Forum 39, 3 (2020), 619–646.Google ScholarCross Ref
- Hsiang-Yun Wu, Shigeo Takahashi, Daichi Hirono, Masatoshi Arikawa, Chun-Cheng Lin, and Hsu-Chun Yen. 2013. Spatially Efficient Design of Annotated Metro Maps. Comput. Graph. Forum 32, 3 (2013), 261–270.Google ScholarDigital Library
- Hsiang-Yun Wu, Shigeo Takahashi, Chun-Cheng Lin, and Hsu-Chun Yen. 2012. Travel-Route-Centered Metro Map Layout and Annotation. Comput. Graph. Forum 31, 3 (2012), 925–934.Google ScholarDigital Library
Index Terms
- Metro Maps on Flexible Base Grids
Index terms have been assigned to the content through auto-classification.
Recommendations
Realtime linear cartograms and metro maps
SIGSPATIAL '18: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsWe introduce an efficient algorithm for drawing spatially-informative linear cartograms: transforming a geometric network such that given edge lengths are realised, while distorting edge directions as little as possible. Our algorithm is based on ...
Metro maps of science
KDD '12: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data miningAs the number of scientific publications soars, even the most enthusiastic reader can have trouble staying on top of the evolving literature. It is easy to focus on a narrow aspect of one's field and lose track of the big picture. Information overload ...
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automatically draw appealing metro maps. There are two aspects to ...
Comments