Metrochrones: Schematic Isochrones for Schematic Metro Maps

References

• Bast, H., Brosi, P. and Storandt, S. (2020) “Metro Maps on Octilinear Grid Graphs” Computer Graphics Forum 39 (3) pp.357–367.
   Web of Science ®Google Scholar
• Baum, M., Bläsius, T., Gemsa, A., Rutter, I. and Wegner, F. (2018) “Scalable Exact Visualization of Isocontours in Road Networks Via Minimum-Link Paths” Journal of Computational Geometry 9 (1) pp.24–70.
   Google Scholar
• Baum, M., Buchhold, V., Dibbelt, J., and Wagner, D. (2016) “Fast Exact Computation of Isochrones in Road Networks” In Goldberg, A.V. and Kulikov, A.S. (Eds) International Symposium on Experimental Algorithms Lecture Notes in Computer Science (LNTCS) Cham, Switzerland: Springer International Publishing, pp.17–32 DOI: 10.1007/978-3-319-38851-9_2.
   Google Scholar
• Bekos, M.A., Niedermann, B. and Nöllenburg, M. (2019) “External Labeling Techniques: A Taxonomy and Survey” Computer Graphics Forum 38 (3) pp.833–860.
   Web of Science ®Google Scholar
• Birkhoff, G.D. (1933) Aesthetic Measure Cambridge, MA and London, England: Harvard University Press DOI: 10.4159/harvard.9780674734470.
   Google Scholar
• Bonerath, A., Niedermann, B. and Haunert, J.-H. (2019) “Retrieving Alpha-Shapes and Schematic Polygonal Approximations for Sets of Points within Queried Temporal Ranges” Proc. 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL'19) ACM, pp.249–258 DOI: 10.1145/3347146.3359087.
   Google Scholar
• Boselie, F. and Leeuwenberg, E. (1984) “A General Notion of Beauty Used To Quantify The Aesthetic Attractivity of Geometric Forms” Cognitive Processes in the Perception of Art Vol. 19: Advances in Psychology, pp.367–387 DOI: 10.1016/S0166-4115(08)62359-6
   Google Scholar
• Bouts, Q.W., Kostitsyna, I., van Kreveld, M., Meulemans, W., Sonke, W. and Verbeek, K. (2016) “Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance” 24th Annual European Symposium on Algorithms (ESA '16) Vol. 57: Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp.22:1–22:16 DOI: 10.4230/LIPIcs.ESA.2016.22.
   Google Scholar
• Brimkov, V.E., Barneva, R.P. and Brimkov, B. (2011) “Connected Distance-based Rasterization of Objects in Arbitrary Dimension” Graphical Models 73 (6) pp.323–334.
   Google Scholar
• Buchin, K., Meulemans, W., Renssen, A.V. and Speckmann, B. (2016) “Area-Preserving Simplification and Schematization of Polygonal Subdivisions” ACM Transactions on Spatial Algorithms and Systems 2 (1) pp.1–36 DOI: 10.1145/2818373.
   Web of Science ®Google Scholar
• Buchin, K., van Goethem, A., Hoffmann, M., van Kreveld, M. and Speckmann, B. (2014) “Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations” In Duckham, M., Pebesma, E., Stewart, K. and Frank, A.U. (Eds) Geographic Information Science Cham, Switzerland: Springer International Publishing, pp.18–33. DOI: 10.1007/978-3-319-11593-1_2
   Google Scholar
• Burghardt, D., Duchêne, C. and Mackaness, W. (Eds) (2014) Abstracting Geographic Information in a Data Rich World Lecture Notes in Geoinformation and Cartography Cham, Switzerland: Springer DOI: 10.1007/978-3-319-00203-3.
   Google Scholar
• Cicerone, S. and Cermignani, M. (2012) “Fast and Simple Approach for Polygon Schematization” In Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C, Taniar, D. and Apduhan, B.O. (Eds) Computational Science and Its Applications (ICCSA 2012) Berlin, Heidelberg: Springer, pp.267–279 DOI: 10.1007/978-3-642-31125-3_21.
   Google Scholar
• Delling, D., Gemsa, A., Nöllenburg, M. and Pajor, T. (2010) “Path Schematization for Route Sketches” In Kaplan, H. (Ed.) Algorithm Theory – SWAT 2010 Lecture Notes in Computer Science (LNTCS) Berlin, Heidelberg: Springer, pp.285–296 DOI: 10.1007/978-3-642-13731-0_27
   Google Scholar
• Delling, D., Gemsa, A., Nöllenburg, M., Pajor, T. and Rutter, I. (2014) “On D-regular Schematization of Embedded Paths” Computational Geometry 47 (3, Part A) pp.381–406.
   Google Scholar
• Denain, J.-C. and Langlois, P. (1998) “Cartographie En Anamorphose” Mappemonde 49 (1) pp.16–19.
   Google Scholar
• Di Giacomo, E., Didimo, W., Liotta, G. and Meijer, H. (2011) “Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings” Theory of Computing Systems 49 pp.565–575.
   Google Scholar
• Dijkstra, E.W. (1959) “A Note on Two Problems in Connexion with Graphs” Numerische Mathematik1 (1) pp.269–271.
   Google Scholar
• Eades, P. and Rappaport, D. (1993) “The Complexity of Computing Minimum Separating Polygons” Pattern Recognition Letters 14 (9) pp.715–718.
   Google Scholar
• Edelsbrunner, H. and Preparata, F. (1988) “Minimum Polygonal Separation” Information and Computation 77 (3) pp.218–232.
   Google Scholar
• Eysenck, H.J. (1941) “The Empirical Determination of An Aesthetic Formula.” Psychological Review 48 (1) p.83.
   Google Scholar
• Forsch, A., Dehbi, Y., Niedermann, B., Oehrlein, J., Rottmann, P. and Haunert, J.-H. (2021) “Multimodal Travel-time Maps with Formally Correct and Schematic Isochrones” Transactions in GIS 25 (6) pp.3233–3256.
   Google Scholar
• Galvão, M.D.L., Krukar, J., Nöllenburg, M. and Schwering, A. (2020) “Route Schematization with Landmarks” Journal of Spatial Information Science 2020 (21) pp.99–136.
   Google Scholar
• Garland, K. (1994) Mr Beck's Underground Map London, England: Capital Transport.
   Google Scholar
• Hong, S.-H. and Merrick, D. (2006) “Automatic Visualisation of Metro Maps” Journal of Visual Languages & Computing 17 (3) pp.203–224.
   Google Scholar
• Huang, W., Eades, P. and Hong, S.-H. (2014) “Larger Crossing Angles Make Graphs Easier to Read” Journal of Visual Languages & Computing 25 (4) pp.452–465.
   Google Scholar
• Huang, W., Hong, S.-H. and Eades, P. (2008) “Effects of Crossing Angles” 2008 IEEE Pacific Visualization Symposium pp.41–46 DOI: 10.1109/PACIFICVIS.2008.4475457.
   Google Scholar
• Löffler, M. and Meulemans, W. (2017) “Discretized Approaches to Schematization” In Gudmundsson, J. and Smid, M.H.M. (Eds) Proc. 29th Canadian Conference on Computational Geometry (CCCG) Ottawa, Canada, pp.220–225.
   Google Scholar
• MacEachren, A.M. (1985) “Compactness of Geographic Shape: Comparison and Evaluation of Measures” Geografiska Annaler: Series B, Human Geography 67 (1) pp.53–67.
   Web of Science ®Google Scholar
• Melbourne and Metropolitan Tramways Board (1922) “Minimum Railway or Tramway Time Zones” Available at: http://handle.slv.vic.gov.au/10381/170543 (Accessed: 26th June 2024).
   Google Scholar
• Meulemans, W. (2014) “Similarity Measures and Algorithms for Cartographic Schematization” (PhD thesis) Technische Universiteit Eindhoven.
   Google Scholar
• Nickel, S. and Nöllenburg, M. (2019), “Drawing k-linear Metro Maps” Proceedings of the 2nd Schematic Mapping Workshop Available at: https://www.ac.tuwien.ac.at/files/pub/smw19-paper-6.pdf.
   Google Scholar
• Niedermann, B., Nöllenburg, M. and Rutter, I. (2017) “Radial Contour Labeling with Straight Leaders” Pacific Visualization Symposium (PacificVis'17) IEEE DOI: 10.1109/PACIFICVIS.2017.8031608.
   Google Scholar
• Nöllenburg, M. and Wolff, A. (2006) “A Mixed-Integer Program for Drawing High-Quality Metro Maps” In Healy, P. and Nikolov, N.S. (Eds) Graph Drawing Lecture Notes in Computer Science (LNTCS) Berlin, Heidelberg: Springer, pp.321–333 DOI: 10.1007/11618058_29.
   Google Scholar
• Nöllenburg, M. and Wolff, A. (2011) “Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming” IEEE Transactions on Visualization and Computer Graphics 17 (5) pp.626–641.
   PubMed Web of Science ®Google Scholar
• Osserman, R. (1978) “The Isoperimetric Inequality” Bulletin of the American Mathematical Society 84 (6) pp.1182–1238.
   Web of Science ®Google Scholar
• Purchase, H. (1997) “Which Aesthetic has the Greatest Effect on Human Understanding?” In DiBattista, G. (Ed.) Graph Drawing Berlin, Heidelberg: Springer, pp.248–261 DOI: 10.1007/3-540-63938-1_67.
   Google Scholar
• Purchase, H.C. (2000) “Effective Information Visualisation: a Study of Graph Drawing Aesthetics and Algorithms” Interacting with Computers 13 (2) pp.147–162.
   Google Scholar
• Pyrga, E., Schulz, F., Wagner, D. and Zaroliagis, C. (2008) “Efficient Models for Timetable Information in Public Transportation Systems” ACM Journal of Experimental Algorithmics 12 pp.1–39.
   Google Scholar
• Régie Autonome des Transports Parisiens (2023) “Metro Map” Available at: https://www.ratp.fr/en/plan-metro (Accessed: 13th April 2023).
   Google Scholar
• Stott, J., Rodgers, P., Martínez-Ovando, J.C. and Walker, S.G. (2011) “Automatic Metro Map Layout Using Multicriteria Optimization” IEEE Transactions on Visualization and Computer Graphics 17 (1) pp.101–114.
   PubMed Web of Science ®Google Scholar
• Tamassia, R. (1987) “On Embedding a Graph in the Grid with the Minimum Number of Bends” SIAM Journal on Computing 16 (3) pp.421–444.
   Web of Science ®Google Scholar
• van Dijk, T.C., van Goethem, A., Haunert, J.-H., Meulemans, W. and Speckmann, B. (2014) “Map Schematization with Circular Arcs” In Duckham, M., Pebesma, E., Stewart, K. and Frank, A.U. (Eds) Geographic Information Science International Publishing Lecture Notes in Computer Science (LNISA) Cham Switzerland: Springer, pp.1–17 DOI: 10.1007/978-3-319-11593-1_1.
   Google Scholar
• van Goethem, A., Meulemans, W., Speckmann, B. and Wood, J. (2015) “Exploring Curved Schematization of Territorial Outlines” IEEE Transactions on Visualization and Computer Graphics 21 (8) pp.889–902.
   PubMedGoogle Scholar
• Van Lier, R.J. (1996) Simplicity of Visual Shape: A Structural Information Approach Nijmegen, The Netherlands: NICI (Nijmegen Instituut voor Cognitie en Informatie).
   Google Scholar
• Verkehrbund Rhein-Sieg (2023) “Fahrplanauskunft” Available at: https://www.vrs.de/fahren/fahrplanauskunft (Accessed: 27th February 2023).
   Google Scholar
• Verkehrbund Rhein-Sieg (2023) “SCHIENENNETZ 2023, Region Köln” Available at: https://www.vrs.de/fileadmin/Dateien/Downloadcenter/Netzplaene/Schienennetz_RegionKoeln_2023.pdf (Accessed: 27th February 2023).
   Google Scholar
• Ware, C., Purchase, H., Colpoys, L., and McGill, M. (2002) “Cognitive Measurements of Graph Aesthetics” Information Visualization 1 (2) pp.103–110.
   Google Scholar
• Wenzheng, L., Junjun, L. and Shunli, Y. (2019) “An Improved Dijkstra's Algorithm for Shortest Path Planning on 2D Grid Maps” 2019 IEEE 9th International Conference on Electronics Information and Emergency Communication (ICEIEC) pp.438–441 DOI: 10.1109/ICEIEC.2019.8784487
   Google Scholar
• Winter, S. (2002) “Modeling Costs of Turns in Route Planning” Geoinformatica 6 (4) pp.345–361.
   Web of Science ®Google Scholar
• Wu, H.-Y., Niedermann, B., Takahashi, S., Roberts, M.J. and Nöllenburg, M. (2020) “A Survey on Transit Map Layout – From Design, Machine, and Human Perspectives” Computer Graphics Forum 39 (3) pp.619–646.
   PubMed Web of Science ®Google Scholar