Automatic visualisation of metro maps

Journal of Visual Languages and Computing

Volumn 17, Issue 3, 2006, Pages 203-224

  Hong, Seok Hee ^a   Merrick, Damian ^a   do Nascimento, Hugo A D ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b FEDERAL UNIVERSITY OF GOIÁS   (Brazil)

Author keywords

Metro map labelling; Metro map layout; Metro map metaphor

Indexed keywords

EID: 33646489321     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2005.09.001     Document Type: Article

References (24)

1. Hong S.-H., Merrick D., and do Nascimento H.A.D. The metro map layout problem. Proceedings of Australasian Symposium on Information Visualisation, (invis.au'04), Conferences in Research and Practice in Information Technology vol. 35 (2004), ACS 91-100
2. S.-H. Hong, D. Merrick, H.A.D. do Nascimento, The metro map layout problem, Proceedings of Graph Drawing 2004, Lecture Notes in Computer Science, Springer, Berlin, 2004, pp. 482-491.
3. Sydney Cityrail Network, 〈http://www.cityrail.info/networkmaps/mainmap.jsp 〉.
4. K. Nesbitt, Multi-sensory display of abstract data, Ph.D. Thesis, University of Sydney, Australia, 2003.
5. Hahn W.C., and Weinberg R.A. A subway map of cancer pathways. Nature Reviews Cancer 2 5 (2002)
6. O'Reilly book network, 〈http://www.oreilly.de/artikel/routemap.pdf 〉.
7. Sandvad E.S., Gronbak K., Sloth L., and Knudsen J.L. Metro map metaphor for guided tours on the web: the webwise guided tour system. Proceedings of International Conference on World Wide Web (2001) 326-333
8. Bang T., Gronbak K., and Hansen P.S. Using a metro map metaphor for organizing web-based learning resources. Proceedings of ED-MEDIA 2002 (2002) 647-652
9. Burkhard R.A., and Meier M. Tube map: evolution of a visual metaphor for interfunctional communication of complex projects. Proceedings of I-KNOW '04 (2004) 449-456
10. Garland K. Mr. Beck's Underground Map (1994), Capital Transport Publishing, England
11. Tufte E.R. Visual Explanations (1997), Graphics Press, Cheshire
12. Frick A., Ludwig A., and Mehldau H. A fast adaptive layout algorithm for undirected graphs. Graph Drawing 94, Lecture Notes in Computer Science vol. 894 (1995), Springer, Berlin 388-403
13. Bertault F. A force-directed algorithm that preserves edge crossing properties. Graph Drawing 99, Lecture Notes in Computer Science vol. 1731 (1999), Springer, Berlin 351-358
14. Sugiyama K., and Misue K. Graph drawing by magnetic spring model. Journal of Visual Languages and Computing 6 3 (1995) 217-231
15. Eades P. A heuristic for graph drawing. Congressus Numerantium 42 (1984) 149-160
16. Metropolis N., Rosenbluth W., Rosenbluth M.N., and Teller A.H. Equation of state calculations by fast computer machines. Journal of Chemical Physics 21 1087 (1953)
17. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
18. Edmondson S., Christensen J., Marks J., and Shieber S. A general cartographic labeling algorithm. Cartographica 33 4 (1995) 13-23
19. Zoraster S. The solution of large 0-1 integer programming problems encountered in automated cartography. Operations Research 38 5 (1990) 752-759
20. T. Strijk, B. Verweij, K. Aardal, Algorithms for maximum independent set applied to map labelling, Technical Report UU-CS-2000-22, Universiteit Utrecht, Netherlands, 2000.
21. do Nascimento H.A.D., and Eades P. User hints for map labelling. Proceedings of Australasian Computer Science Conference 2003, Conferences in Research and Practice in Information Technology vol. 16 (2003), ACS 339-347
22. H.A.D. do Nascimento, User hints for optimization processes, Ph.D. Thesis, University of Sydney, Australia, 2003.
23. C. Friedrich, jjGraph, personal communication.
24. Stott J.M., and Rodgers P. Metro map layout using multicriteria optimization. Proceedings of International Conference on Information Visualisation (IV04) (2004) 355-362