{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:45:59Z","timestamp":1770741959339,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Forsch. Entw."],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s00450-007-0036-y","type":"journal-article","created":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T01:44:40Z","timestamp":1196214280000},"page":"23-44","source":"Crossref","is-referenced-by-count":51,"title":["Drawing Subway Maps: A\u00a0Survey"],"prefix":"10.1007","volume":"22","author":[{"given":"Alexander","family":"Wolff","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,29]]},"reference":[{"key":"36_CR1","unstructured":"Avelar S, M\u00fcller M (2000) Generating topologically correct schematic maps. In: Proc. 9th Internat. Sympos. Spatial Data Handling (SDH\u201900), pages 4a.28\u20134a.35"},{"key":"36_CR2","unstructured":"Barkowsky T, Latecki LJ, Richter KF (2000) Schematizing maps: Simplification of geographic shape by discrete curve evolution. In: Freksa C, Brauer W, Habel C, Wender KF (Eds) Proc. Spatial Cognition II \u2013 Integrating abstract theories, empirical studies, formal models, and practical applications. Lect Notes Artific Intell 1849:41\u201353"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Bekos M, Kaufmann M, Potika K, Symvonis A (2008) Line crossing minimization on metro maps. In: Hong SH, Nishizeki T (Eds) Proc. 15th Internat. Sympos. Graph Drawing (GD\u201907), Lect Notes Comput Sci 4875:231\u2013242. Springer-Verlag","DOI":"10.1007\/978-3-540-77537-9_24"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Benkert M, N\u00f6llenburg M, Uno T, Wolff A (2007) Minimizing intra-edge crossings in wiring diagrams and public transport maps. In: Kaufmann M, Wagner D (Eds) Proc. 14th Internat. Sympos Graph Drawing (GD\u201906), Lect Notes Comput Sci 4372:270\u2013281","DOI":"10.1007\/978-3-540-70904-6_27"},{"issue":"1","key":"36_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(00)00042-9","volume":"74","author":"F Bertault","year":"2000","unstructured":"Bertault F (2000) A force-directed algorithm that preserves edge-crossing properties. Inf Proc Lett 74(1):7\u201313","journal-title":"Inf Proc Lett"},{"issue":"2","key":"36_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.comgeo.2005.02.001","volume":"32","author":"C Binucci","year":"2005","unstructured":"Binucci C, Didimo W, Liotta G, Nonato M (2005) Orthogonal drawings of graphs with vertex and edge labels. Comput Geom Theory Appl 32(2):71\u2013114","journal-title":"Comput Geom Theory Appl"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Brandes U, Eiglsperger M, Kaufmann M, Wagner D (2002) Sketch-driven orthogonal graph drawing. In: Kobourov SG, Goodrich MT (Eds) Proc. 10th Internat. Sympos. Graph Drawing (GD\u201902), Lect Notes Comput Sci 2528:1\u201311","DOI":"10.1007\/3-540-36151-0_1"},{"issue":"3","key":"36_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.comgeo.2004.11.002","volume":"30","author":"S Cabello","year":"2005","unstructured":"Cabello S, de Berg M, van Kreveld M (2005) Schematization of networks. Comput Geom Theory Appl 30(3):223\u2013238","journal-title":"Comput Geom Theory Appl"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Cabello S, van Kreveld M (2003) Approximation algorithms for aligning points. In: Proc. 19th Annu. ACM Sympos. Comput. Geom. (SoCG\u201903), pp 20\u201328","DOI":"10.1145\/777792.777796"},{"key":"36_CR10","volume-title":"Graph Drawing","author":"G Battista Di","year":"1999","unstructured":"Di Battista G, Eades P, Tamassia R, Tollis IG (1999) Graph Drawing. Prentice Hall, Upper Saddle River, NJ"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Eiglsperger M, Fekete SP, Klau GW (2001) Orthogonal graph drawing. In: Kaufmann M, Wagner D (Eds) Drawing Graphs: Methods and Models, Lect Notes Comput Sci 2025(6)121\u2013171","DOI":"10.1007\/3-540-44969-8_6"},{"issue":"11","key":"36_CR12","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129\u20131164","journal-title":"Softw Pract Exp"},{"issue":"2","key":"36_CR13","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg A, Tamassia R (2001) On the computational complexity of upward and rectilinear planarity testing. SIAM J Comput 31(2):601\u2013625","journal-title":"SIAM J Comput"},{"key":"36_CR14","volume-title":"Mr Beck\u2019s Underground Map","author":"K Garland","year":"1994","unstructured":"Garland K (1994) Mr Beck\u2019s Underground Map. Capital Transport Publishing, Harow Weald, Middlesex, England"},{"issue":"3","key":"36_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.jvlc.2005.09.001","volume":"17","author":"SH Hong","year":"2006","unstructured":"Hong SH, Merrick D, do Nascimento HAD (2006) Automatic visualisation of metro maps. J Vis Lang Comput 17(3):203\u2013224","journal-title":"J Vis Lang Comput"},{"issue":"4","key":"36_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmakar","year":"1984","unstructured":"Karmakar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373\u2013395","journal-title":"Combinatorica"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Klau GW, Mutzel P (1999) Combining graph labeling and compaction. In: Kratochv\u00edl J (Ed) Proc. 7th Internat. Sympos. Graph Drawing (GD\u201999), Lect Notes Comput Sci 1731:27\u201337","DOI":"10.1007\/3-540-46648-7_3"},{"issue":"3","key":"36_CR18","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth DE, Raghunathan A (1992) The problem of compatible representatives. SIAM J Discr Math 5(3):422\u2013427","journal-title":"SIAM J Discr Math"},{"issue":"2","key":"36_CR19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein D (1982) Planar formulae and their uses. SIAM J Comput 11(2):329\u2013343","journal-title":"SIAM J Comput"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Merrick D, Gudmundsson J (2006) Path simplification for metro map layout. In: Kaufmann M, Wagner D (Eds) Proc. 14th Internat. Sympos. Graph Drawing (GD\u201906), Lect Notes Comput Sci 4372:258\u2013269","DOI":"10.1007\/978-3-540-70904-6_26"},{"issue":"2","key":"36_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1179\/caj.1996.33.2.93","volume":"33","author":"A Morrison","year":"1996","unstructured":"Morrison A (1996) Public transport maps in western european cities. Cartogr J 33(2):93\u2013110","journal-title":"Cartogr J"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Nesbitt KV (2004) Getting to more abstract places using the metro map metaphor. In: Proc. 8th Internat. Conf. Inform. Visualisation (IV\u201904), IEEE Computer Society pp. 488\u2013493","DOI":"10.1109\/IV.2004.1320189"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Neyer G (1999) Line simplification with restricted orientations. In: Dehne FK, Gupta A, Sack JR, Tamassia R (Eds) Proc. 6th Internat. Workshop Algorithms Data Struct. (WADS\u201999), Lect Notes Comput Sci 1663:13\u201324","DOI":"10.1007\/3-540-48447-7_2"},{"key":"36_CR24","unstructured":"N\u00f6llenburg M (2005) Automated drawings of metro maps. Technical Report 2005-25, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe. Available at http:\/\/www.ubka.uni-karlsruhe.de\/indexer-vvv\/ira\/2005\/25"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg M, Wolff A (2006) A mixed-integer program for drawing high-quality metro maps. In: Healy P, Nikolov NS (Eds) Proc. 13th Internat. Sympos. Graph Drawing (GD\u201905), Lect Notes Comput Sci 3843:321\u2013333","DOI":"10.1007\/11618058_29"},{"key":"36_CR26","volume-title":"Metro Maps of the World","author":"M Ovenden","year":"2003","unstructured":"Ovenden M (2003) Metro Maps of the World. Capital Transport Publishing, Harrow Weald, Middlesex, England"},{"key":"36_CR27","unstructured":"Polatschek K (2006) Die Sch\u00f6nheit des Untergrundes. Frankfurter Allgemeine Sonntagszeitung 28, 16 July. Available via http:\/\/fazarchiv.faz.net"},{"key":"36_CR28","unstructured":"Roberts M (2007) Personal email communication"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Sandvad ES, Gr\u00f8nbaek K, Sloth L, Knudsen JL (2001) A metro map metaphor for guided tours on the Web: the Webvise Guided Tour System. In: Proc. 10th Internat. World Wide Web Conf. (WWW\u201901), pp. 326\u2013333. ACM Press","DOI":"10.1145\/371920.372079"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"Stott J, Rodgers P (2004) Metro map layout using multicriteria optimization. In: Proc. 8th Internat. Conf. Inform. Visualisation (IV\u201904), pp. 355\u2013362. IEEE Comput Soc","DOI":"10.1109\/IV.2004.1320168"},{"key":"36_CR31","unstructured":"Stott JM, Rodgers P (2005) Automatic metro map design techniques. In: Proc. 22nd Internat. Cartographic Conf. (ICC\u201905), La Coru\u00f1a, Spain"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Stott JM, Rodgers P, Burkhard RA, Meier M, Smis MTJ (2005) Automatic layout of project plans using a metro map metaphor. In: Proc. 9th Internat. Conf. Inform. Visualisation (IV\u201905), pp. 203\u2013206","DOI":"10.1109\/IV.2005.26"},{"key":"36_CR33","unstructured":"Sydney CityRail"},{"issue":"3","key":"36_CR34","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia R (1987) On embedding a graph in the grid with the minimum number of bends. SIAM J Comput 16(3):421\u2013444","journal-title":"SIAM J Comput"},{"issue":"1","key":"36_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1467-9671.2006.00242.x","volume":"10","author":"JM Ware","year":"2006","unstructured":"Ware JM, Anand S, Taylor GE, Thomas N (2006) Automated production of schematic maps for mobile applications. Trans in GIS 10(1):25\u201342","journal-title":"Trans in GIS"},{"key":"36_CR36","unstructured":"X Initiative. http:\/\/www.xinitiative.org"}],"container-title":["Informatik - Forschung und Entwicklung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-007-0036-y.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T03:49:35Z","timestamp":1557028175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-007-0036-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,29]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s00450-007-0036-y","relation":{},"ISSN":["0178-3564","0949-2925"],"issn-type":[{"value":"0178-3564","type":"print"},{"value":"0949-2925","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,29]]}}}