메뉴 건너뛰기




Volumn 4372 LNCS, Issue , 2007, Pages 54-65

Angle and distance constraints on tree drawings

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; EDGE DETECTION;

EID: 38149010622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_7     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 1
    • 33744956120 scopus 로고    scopus 로고
    • Drawing phylogenetic trees
    • Proc. 16th Intl. Symp. Algorithms and Computation ISAAC '05, of, Springer
    • C. Bachmaier, U. Brandes, and B. Schlieper. Drawing phylogenetic trees. In Proc. 16th Intl. Symp. Algorithms and Computation (ISAAC '05), volume 3827 of LNCS, pages 1110-1121. Springer, 2005.
    • (2005) LNCS , vol.3827 , pp. 1110-1121
    • Bachmaier, C.1    Brandes, U.2    Schlieper, B.3
  • 3
    • 51249179364 scopus 로고
    • Triangulating a simple polygon in linear time
    • B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6(5):485-524, 1991.
    • (1991) Discrete Comput. Geom , vol.6 , Issue.5 , pp. 485-524
    • Chazelle, B.1
  • 4
    • 84958980832 scopus 로고    scopus 로고
    • Drawing planar graphs with circular arcs
    • Proc. Graph Drawing 1999, of, Springer
    • C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Drawing planar graphs with circular arcs. In Proc. Graph Drawing 1999, volume 1731 of LNCS, pages 117-126. Springer, 1999.
    • (1999) LNCS , vol.1731 , pp. 117-126
    • Cheng, C.C.1    Duncan, C.A.2    Goodrich, M.T.3    Kobourov, S.G.4
  • 5
    • 0346869829 scopus 로고
    • Fixed edge-length graph drawing is NP-hard
    • P. Eades and N. C. Wormald. Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics, 28:111-134, 1990.
    • (1990) Discrete Applied Mathematics , vol.28 , pp. 111-134
    • Eades, P.1    Wormald, N.C.2
  • 6
    • 24144482363 scopus 로고    scopus 로고
    • Curvilinear Graph Drawing Using the Force-Directed Method
    • Proc. Graph Drawing 2004, of, Springer
    • B. Finkel and R. Tamassia. Curvilinear Graph Drawing Using the Force-Directed Method. In Proc. Graph Drawing 2004, volume 3383 of LNCS, pages 448-453. Springer, 2004.
    • (2004) LNCS , vol.3383 , pp. 448-453
    • Finkel, B.1    Tamassia, R.2
  • 7
    • 84957539235 scopus 로고
    • On drawing angle graphs
    • Proc. Graph Drawing 1994, of, Springer
    • A. Garg. On drawing angle graphs. In Proc. Graph Drawing 1994, volume 894 of LNCS, pages 84-95. Springer, 1994.
    • (1994) LNCS , vol.894 , pp. 84-95
    • Garg, A.1
  • 8
    • 4043064916 scopus 로고    scopus 로고
    • Embedding vertices at points: Few bends suffice for planar graphs
    • M. Kaufmann and R. Wiese. Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications, 6(1):115-129, 2002.
    • (2002) Journal of Graph Algorithms and Applications , vol.6 , Issue.1 , pp. 115-129
    • Kaufmann, M.1    Wiese, R.2
  • 10
    • 84957880261 scopus 로고    scopus 로고
    • Embedding planar graphs at fixed vertex locations
    • Proc. Graph Drawing 1998, of, Springer
    • J. Pach and R. Wenger. Embedding planar graphs at fixed vertex locations. In Proc. Graph Drawing 1998, volume 1547 of LNCS, pages 263-274. Springer, 1998.
    • (1998) LNCS , vol.1547 , pp. 263-274
    • Pach, J.1    Wenger, R.2


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