메뉴 건너뛰기




Volumn 1353, Issue , 1997, Pages 25-36

On embedding an outer-planar graph in a point set

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS); GEOMETRY; GRAPHIC METHODS;

EID: 64949121097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_47     Document Type: Conference Paper
Times cited : (10)

References (20)
  • 2
    • 0006886803 scopus 로고    scopus 로고
    • Characterizing proximity trees
    • P. Bose, W. Lenhaxt, and G. Liotta. Characterizing proximity trees. Algorithmica, 16:83-110, 1996.
    • (1996) Algorithmica , vol.16 , pp. 83-110
    • Bose, P.1    Lenhaxt, W.2    Liotta, G.3
  • 4
    • 0039581375 scopus 로고
    • Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, to appear
    • P. Bose, M. McAllister, and J. Snoeyink. Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, to appear. Also appears in Proceedings of Graph Drawing GD'95, LNCS 1027, pp. 64-75, 1995.
    • (1995) Proceedings of Graph Drawing GD'95, LNCS , vol.1027 , pp. 64-75
    • Bose, P.1    McAllister, M.2    Snoeyink, J.3
  • 5
    • 84922451359 scopus 로고
    • On the convex layers of a planar set
    • B. Chazelle. On the convex layers of a planar set. IEEE Trans. on Inf. Theory, IT-31:509-517, 1985.
    • (1985) IEEE Trans. on Inf. Theory , vol.IT-31 , pp. 509-517
    • Chazelle, B.1
  • 10
    • 0028022433 scopus 로고
    • The realization problem for Euclidean minimum spanning trees is NP-hard
    • P. Eades and S. Whitesides. The realization problem for Euclidean minimum spanning trees is NP-hard. In Proc. 10th Annu. ACM Sympos. Cornput. Geom., pages 49-56, 1994.
    • (1994) Proc. 10Th Annu. ACM Sympos. Cornput. Geom , pp. 49-56
    • Eades, P.1    Whitesides, S.2
  • 11
    • 0001567493 scopus 로고
    • On straight line representation of planar graphs
    • I. Fary. On straight line representation of planar graphs. Acta Sci. Math. Szeged, 11:229-233, 1948.
    • (1948) Acta Sci. Math. Szeged , vol.11 , pp. 229-233
    • Fary, I.1
  • 12
    • 0004489683 scopus 로고
    • Embedding a planar triangulation with vertices at specified points (Solution to problem e3341
    • P. Gritzmann, B. Mohar, J. Pach, and R. Pollack. Embedding a planar triangulation with vertices at specified points (solution to problem e3341. American Mathematical Monthly, 98:165-166, 1991.
    • (1991) American Mathematical Monthly , vol.98 , pp. 165-166
    • Gritzmann, P.1    Mohar, B.2    Pach, J.3    Pollack, R.4
  • 13
    • 0000747134 scopus 로고
    • Applications of a semi-dynamic convex hull algorithm
    • John Hershberger and Subhash Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249-267, 1992.
    • (1992) BIT , vol.32 , pp. 249-267
    • Hershberger, J.1    Suri, S.2
  • 16
    • 0342825403 scopus 로고
    • Fast detection and display of symmetry in trees
    • J. Manning and M. J. Atallah. Fast detection and display of symmetry in trees. Congressu8 Numerantium, 64:159-169, 1988.
    • (1988) Congressu8 Numerantium , vol.64 , pp. 159-169
    • Manning, J.1    Atallah, M.J.2
  • 20
    • 0040766848 scopus 로고
    • Layout of rooted trees
    • W. T. Trotter, editor, American Mathematical Society
    • János Pach and Jenö Töröcsik. Layout of rooted trees. In W. T. Trotter, editor, Planar Graphs, volume 9 of DIMACS Series, pages 131-137. American Mathematical Society, 1993.
    • (1993) Planar Graphs, Volume 9 of DIMACS Series , pp. 131-137
    • Pach, J.1    Töröcsik, J.2


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