메뉴 건너뛰기




Volumn 3383, Issue , 2004, Pages 482-491

The metro map layout problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; DATA PROCESSING; DRAWING (GRAPHICS); VIRTUAL REALITY;

EID: 24144446983     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (23)

References (14)
  • 1
    • 84958969766 scopus 로고    scopus 로고
    • A force-directed algorithm that preserves edge crossing properties
    • LNCS 1731, Springer Verlag
    • F. Bertault, A Force-Directed Algorithm that Preserves Edge Crossing Properties, Graph Drawing 99, LNCS 1731, pp. 351-358, Springer Verlag, 1999.
    • (1999) Graph Drawing 99 , pp. 351-358
    • Bertault, F.1
  • 2
    • 84957542241 scopus 로고
    • A fast adaptive layout algorithm for undirected graphs
    • LNCS 894, Springer Verlag
    • A. Frick, A. Ludwig and H. Mehldau, A Fast Adaptive Layout Algorithm for Undirected Graphs, Graph Drawing 94, LNCS 894, pp. 388-403, Springer Verlag, 1995.
    • (1995) Graph Drawing 94 , pp. 388-403
    • Frick, A.1    Ludwig, A.2    Mehldau, H.3
  • 13
    • 33645622721 scopus 로고    scopus 로고
    • Cityrail Network, http://www.cityrail.info/networkmaps/mainmap.jsp
    • Cityrail Network


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