메뉴 건너뛰기




Volumn 5417 LNCS, Issue , 2009, Pages 336-347

Two polynomial time algorithms for the metro-line crossing minimization problem

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); POLYNOMIAL APPROXIMATION;

EID: 68749114442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00219-9_33     Document Type: Conference Paper
Times cited : (9)

References (9)
  • 2
    • 38549112002 scopus 로고    scopus 로고
    • Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, 4875, pp. 231-242. Springer, Heidelberg (2008)
    • Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 231-242. Springer, Heidelberg (2008)
  • 3
    • 38149086944 scopus 로고    scopus 로고
    • Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in wiring diagrams and public transport maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, 4372, pp. 270-281. Springer, Heidelberg (2007)
    • Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in wiring diagrams and public transport maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 270-281. Springer, Heidelberg (2007)
  • 5
    • 68749092449 scopus 로고    scopus 로고
    • Hong, S.H., Merrick, D., Nascimento, H.: The metro map layout problem. In: Churcher, N., Churcher, C. (eds.) Invis.au 2004. CRPIT, 35, pp. 91-100 (2004)
    • Hong, S.H., Merrick, D., Nascimento, H.: The metro map layout problem. In: Churcher, N., Churcher, C. (eds.) Invis.au 2004. CRPIT, vol. 35, pp. 91-100 (2004)
  • 6
    • 38149095898 scopus 로고    scopus 로고
    • Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, 4372, pp. 258-269. Springer, Heidelberg (2007)
    • Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258-269. Springer, Heidelberg (2007)
  • 7
    • 33745677479 scopus 로고    scopus 로고
    • Nöllenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, 3843, pp. 321-333. Springer, Heidelberg (2006)
    • Nöllenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 321-333. Springer, Heidelberg (2006)


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