메뉴 건너뛰기




Volumn 3843 LNCS, Issue , 2006, Pages 321-333

A mixed-integer program for drawing high-quality metro maps

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPHIC METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

EID: 33745677479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_29     Document Type: Conference Paper
Times cited : (37)

References (12)
  • 1
    • 23044519073 scopus 로고    scopus 로고
    • Schematizing maps: Simplification of geographic shape by discrete curve evolution
    • C. Freksa, W. Brauer, C. Habel, and K. F. Wender, editors, Proc. Spatial Cognition II
    • T. Barkowsky, L. J. Latecki, and K.-F. Richter. Schematizing maps: Simplification of geographic shape by discrete curve evolution. In C. Freksa, W. Brauer, C. Habel, and K. F. Wender, editors, Proc. Spatial Cognition II, volume 1849 of Lecture Notes in Artificial Intelligence, pages 41-53, 2000.
    • (2000) Lecture Notes in Artificial Intelligence , vol.1849 , pp. 41-53
    • Barkowsky, T.1    Latecki, L.J.2    Richter, K.-F.3
  • 3
    • 84867444566 scopus 로고    scopus 로고
    • Sketch-driven orthogonal graph drawing
    • Proc. 10th Int. Symp. on Graph Drawing (GD'02), Springer-Verlag
    • U. Brandes, M. Eiglsperger, M. Kaufmann, and D. Wagner, Sketch-driven orthogonal graph drawing. In Proc. 10th Int. Symp. on Graph Drawing (GD'02), volume 2528 of Lecture Notes in Computer Science, pages 1-11. Springer-Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2528 , pp. 1-11
    • Brandes, U.1    Eiglsperger, M.2    Kaufmann, M.3    Wagner, D.4
  • 6
    • 24144446983 scopus 로고    scopus 로고
    • The metro map layout problem
    • J. Pach, editor, Proc. 12th Int. Symp. on Graph Drawing (GD'04) Springer-Verlag
    • S.-H. Hong, D. Merrick, and H. A. D. d. Nascimento. The metro map layout problem. In J. Pach, editor, Proc. 12th Int. Symp. on Graph Drawing (GD'04), volume 3383 of Lecture Notes in Computer Science, pages 482-491. Springer-Verlag, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3383 , pp. 482-491
    • Hong, S.-H.1    Merrick, D.2    Nascimento, H.A.D.D.3
  • 7
    • 38349007404 scopus 로고    scopus 로고
    • Automated drawings of metro maps
    • Universität Karlsruhe
    • M. Nöllenburg. Automated drawings of metro maps. Technical Report 2005-25, Universität Karlsruhe, 2005. Available at http://www.ubka.uni- karlsruhe.de/cgi-bin/psview?document=/ira/2005/25.
    • (2005) Technical Report , vol.2005 , Issue.25
    • Nöllenburg, M.1
  • 11
    • 84858909099 scopus 로고    scopus 로고
    • Sydney CityRail. www.cityrail.nsw.gov.au/networkmaps/network_map.pdf.
  • 12
    • 0023366861 scopus 로고
    • On embedding a graph in the grid with the minimum number of bends
    • R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.
    • (1987) SIAM J. Comput. , vol.16 , Issue.3 , pp. 421-444
    • Tamassia, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.