Drawing subway maps: A survey

Computer Science - Research and Development

Volumn 22, Issue 1, 2007, Pages 23-44

  Wolff, Alexander ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Graph drawing; Graph labeling; Mixed integer program; NP hard; Octilinear layout; Subway map

Indexed keywords

GRAPH DRAWING; GRAPH LABELINGS; MIXED-INTEGER PROGRAMS; NP-HARD; OCTILINEAR LAYOUT;

DRAWING (GRAPHICS); GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; SURVEYS;

SUBWAYS;

EID: 57849157908     PISSN: 18652034     EISSN: 18652042     Source Type: Journal    
DOI: 10.1007/s00450-007-0036-y     Document Type: Article

References (36)

1. Avelar S, Müller M (2000) Generating topologically correct schematic maps. In: Proc. 9th Internat. Sympos. Spatial Data Handling (SDH'00), pages 4a.28-4a.35
2. 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 - Integrating abstract theories, empirical studies, formal models, and practical applications. Lect Notes Artific Intell 1849:41-53
3. 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'07), Lect Notes Comput Sci 4875:231-242. Springer-Verlag
4. Benkert M, Nöllenburg 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'06), Lect Notes Comput Sci 4372:270-281
5. Bertault F (2000) A force-directed algorithm that preserves edge-crossing properties. Inf Proc Lett 74(1):7-13
6. 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-114
7. 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'02), Lect Notes Comput Sci 2528:1-11
8. Cabello S, de Berg M, van Kreveld M (2005) Schematization of networks. Comput Geom Theory Appl 30(3):223-238
9. Cabello S, van Kreveld M (2003) Approximation algorithms for aligning points. In: Proc. 19th Annu. ACM Sympos. Comput. Geom. (SoCG'03), pp 20-28
10. Di Battista G, Eades P, Tamassia R, Tollis IG (1999) Graph Drawing. Prentice Hall, Upper Saddle River, NJ
11. 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-171
12. Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129-1164
13. Garg A, Tamassia R (2001) On the computational complexity of upward and rectilinear planarity testing. SIAM J Comput 31(2):601-625
14. Garland K (1994) Mr Beck's Underground Map. Capital Transport Publishing, Harow Weald, Middlesex, England
15. Hong SH, Merrick D, do Nascimento HAD (2006) Automatic visualisation of metro maps. J Vis Lang Comput 17(3):203-224
16. Karmakar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373-395
17. Klau GW, Mutzel P (1999) Combining graph labeling and compaction. In: Kratochvíl J (Ed) Proc. 7th Internat. Sympos. Graph Drawing (GD'99), Lect Notes Comput Sci 1731:27-37
18. Knuth DE, Raghunathan A (1992) The problem of compatible representatives. SIAM J Discr Math 5(3):422-427
19. Lichtenstein D (1982) Planar formulae and their uses. SIAM J Comput 11(2):329-343
20. Merrick D, Gudmundsson J (2006) Path simplification for metro map layout. In: Kaufmann M, Wagner D (Eds) Proc. 14th Internat. Sympos. Graph Drawing (GD'06), Lect Notes Comput Sci 4372:258-269
21. Morrison A (1996) Public transport maps in western european cities. Cartogr J 33(2):93-110
22. Nesbitt KV (2004) Getting to more abstract places using the metro map metaphor. In: Proc. 8th Internat. Conf. Inform. Visualisation (IV'04), IEEE Computer Society pp. 488-493
23. 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'99), Lect Notes Comput Sci 1663:13-24
24. Nöllenburg M (2005) Automated drawings of metro maps. Technical Report 2005-25, Fakultät für Informatik, Universität Karlsruhe. Available at http://www.ubka.uni-karlsruhe.de/indexer-vvv/ira/2005/25
25. Nöllenburg 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'05), Lect Notes Comput Sci 3843:321-333
26. Ovenden M (2003) Metro Maps of the World. Capital Transport Publishing, Harrow Weald, Middlesex, England
27. Polatschek K (2006) Die Schönheit des Untergrundes. Frankfurter Allgemeine Sonntagszeitung 28, 16 July. Available via http://fazarchiv.faz.net
28. Roberts M (2007) Personal email communication
29. Sandvad ES, Grønbaek 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'01), pp. 326-333. ACM Press
30. Stott J, Rodgers P (2004) Metro map layout using multicriteria optimization. In: Proc. 8th Internat. Conf. Inform. Visualisation (IV'04), pp. 355-362. IEEE Comput Soc
31. Stott JM, Rodgers P (2005) Automatic metro map design techniques. In: Proc. 22nd Internat. Cartographic Conf. (ICC'05), La Coruña, Spain
32. 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'05), pp. 203-206
33. Sydney CityRail
34. Tamassia R (1987) On embedding a graph in the grid with the minimum number of bends. SIAM J Comput 16(3):421-444
35. Ware JM, Anand S, Taylor GE, Thomas N (2006) Automated production of schematic maps for mobile applications. Trans in GIS 10(1):25-42
36. X Initiative. http://www.xinitiative.org