Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Efficient Generation of Geographically Accurate Transit Maps

Published: 18 September 2019 Publication History
  • Get Citation Alerts
  • Abstract

    We present LOOM (Line-Ordering Optimized Maps), an automatic generator of geographically accurate transit maps. The input to LOOM is data about the lines of a transit network: for each line, its station sequence and geographical course. LOOM proceeds in three stages: (1) construct a line graph, where edges correspond to network segments with the same set of lines following the same course; (2) apply a set of local transformation rules that compute an optimal partial ordering of the lines and speed up the next stage; (3) construct an Integer Linear Program (ILP) that yields a line ordering for each edge and minimizes the total number of line crossings and line separations; and (4) based on the line graph and the computed line ordering, draw the map. As our maps respect the geography of the transit network, they can be used as overlays in typical map services. Previous research either did not take the network geography into account or was only concerned with schematic metro map layouting. We evaluate LOOM on six real-world transit networks, with line-ordering search-space sizes up to 2 × 10267. Using our transformation rules and an improved ILP formulation, we compute optimal line orderings in a fraction of a second for all networks. This enables interactive use of our method in map editors.

    References

    [1]
    Mahmuda Ahmed, Sophia Karagiorgou, Dieter Pfoser, and Carola Wenk. 2015. A comparison and evaluation of map construction algorithms using vehicle tracking data. Geoinformatica 19, 3 (2015), 601--632.
    [2]
    Mahmuda Ahmed and Carola Wenk. 2012. Constructing street networks from GPS trajectories. In Proceedings of the 20th Annual European Conference on Algorithms (ESA’12). Springer, 60--71.
    [3]
    Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, and Antonios Symvonis. 2008. Two polynomial time algorithms for the metro-line crossing minimization problem. In Proceedings of the 16th International Symposium on Graph Drawing (GD’08). 336--347.
    [4]
    Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, and Antonios Symvonis. 2010. On metro-line crossing minimization.J. Graph Algor. Appl. 14, 1 (2010), 75--96.
    [5]
    Matthew Asquith, Joachim Gudmundsson, and Damian Merrick. 2008. An ILP for the metro-line crossing problem. In Proceedings of the 14th Symposium on Computing: The Australasian Theory (CATS’08), Vol. 77. Australian Computer Society, 49--56.
    [6]
    Michael A. Bekos, Michael Kaufmann, Katerina Potika, and Antonios Symvonis. 2008. Line crossing minimization on metro maps. In Proceedings of the 15th International Conference on Graph Drawing (GD’07). Springer, 231--242.
    [7]
    Marc Benkert, Martin Nöllenburg, Takeaki Uno, and Alexander Wolff. 2007. Minimizing intra-edge crossings in wiring diagrams and public transportation maps. In Proceedings of the 14th International Conference on Graph Drawing (GD’06). Springer, 270--281.
    [8]
    Prosenjit Bose, Vida Dujmović, Ferran Hurtado, Stefan Langerman, Pat Morin, and David R. Wood. 2009. A polynomial bound for untangling geometric planar graphs. Discr. Comput. Geom. 42, 4 (2009), 570--585.
    [9]
    Google Developers. 2016. GTFS Static Overview. Retrieved May 15th, 2019 from https://developers.google.com/transit/gtfs.
    [10]
    Anton Dubreau. 2016. Transit Maps: Apple vs. Google vs. Us. Retrieved May 15th, 2019 from https://medium.com/transit-app/transit-maps-apple-vs-google-vs-us-cb3d7cd2c362.
    [11]
    Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell Roberts, Julian Schuhmann, and Alexander Wolff. 2013. Drawing metro maps using Bézier curves. In Proceedings of the 20th International Conference on Graph Drawing (GD’12). Springer, 463--474.
    [12]
    Martin Fink and Sergey Pupyrev. 2013. Metro-line crossing minimization: Hardness, approximations, and tractable cases. In Proceedings of the 21st International Symposium on Graph Drawing (GD’13), Vol. 8242. 328--339.
    [13]
    Martin Fink and Sergey Pupyrev. 2015. Ordering metro lines by block crossings. J. Graph Algor. Appl. 19, 2, 111--153.
    [14]
    Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, and Alexander Wolff. 2009. Untangling a planar graph. Discr. Comput. Geom. 42, 4 (2009), 542--569.
    [15]
    Danny Holten and Jarke J. van Wijk. 2009. Force-directed edge bundling for graph visualization. In Proceedings of the 11th Eurographics/IEEE--VGTC Conference on Visualization (EuroVis’09). The Eurographs Association, 983--998.
    [16]
    Seok-Hee Hong, Damian Merrick, and Hugo A. D. do Nascimento. 2006. Automatic visualisation of metro maps. J. Vis. Lang. Comput. 17, 3 (2006), 203--224.
    [17]
    Martin Nöllenburg. 2010. An improved algorithm for the metro-line crossing minimization problem. In Proceedings of the 17th International Conference on Graph Drawing (GD’09). Springer, 381--392.
    [18]
    Martin Nöllenburg. 2014. A survey on automated metro map layout methods. In Schematic Mapping Workshop, Essex, UK (2014).
    [19]
    Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, and Alexander E. Holroyd. 2012. Edge routing with ordered bundles. In Proceedings of the 19th International Conference on Graph Drawing (GD’11). Springer, 136--147.

    Cited By

    View all
    • (2024)Multilevel Visual Analysis of Aggregate Geo-NetworksIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2022.322995330:7(3135-3150)Online publication date: Jul-2024
    • (2024)Large-Scale Generation of Transit Maps from OpenStreetMap DataThe Cartographic Journal10.1080/00087041.2024.2325761(1-25)Online publication date: 2-Jul-2024
    • (2020)A Survey on Transit Map Layout – from Design, Machine, and Human PerspectivesComputer Graphics Forum10.1111/cgf.1403039:3(619-646)Online publication date: 18-Jul-2020

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Spatial Algorithms and Systems
    ACM Transactions on Spatial Algorithms and Systems  Volume 5, Issue 4
    December 2019
    164 pages
    ISSN:2374-0353
    EISSN:2374-0361
    DOI:10.1145/3361970
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 September 2019
    Accepted: 01 May 2019
    Revised: 01 March 2019
    Received: 01 November 2018
    Published in TSAS Volume 5, Issue 4

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Public transit network
    2. graph drawing
    3. graphical optimization
    4. map generation

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)36
    • Downloads (Last 6 weeks)2

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Multilevel Visual Analysis of Aggregate Geo-NetworksIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2022.322995330:7(3135-3150)Online publication date: Jul-2024
    • (2024)Large-Scale Generation of Transit Maps from OpenStreetMap DataThe Cartographic Journal10.1080/00087041.2024.2325761(1-25)Online publication date: 2-Jul-2024
    • (2020)A Survey on Transit Map Layout – from Design, Machine, and Human PerspectivesComputer Graphics Forum10.1111/cgf.1403039:3(619-646)Online publication date: 18-Jul-2020

    View Options

    Get Access

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media