메뉴 건너뛰기




Volumn 5, Issue 2, 2001, Pages 1-34

Fully dynamic 3-dimensional orthogonal graph drawing

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

EID: 0012771913     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00033     Document Type: Article
Times cited : (16)

References (11)
  • 4
    • 84957890673 scopus 로고    scopus 로고
    • A Split & Push Approach to 3D Orthogonal Drawing
    • Lecture Notes in Computer Science 1547, Springer Verlag
    • G. Di Battista, M. Patrignani, F. Vargiu, A Split & Push Approach to 3D Orthogonal Drawing, Symposium on Graph Drawing 98, Lecture Notes in Computer Science 1547, Springer Verlag, 1998. pp.87-101.
    • (1998) Symposium on Graph Drawing 98 , pp. 87-101
    • Di Battista, G.1    Patrignani, M.2    Vargiu, F.3
  • 5
    • 0030260127 scopus 로고    scopus 로고
    • The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawing
    • P. Eades, C. Stirk, S. Whitesides, The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawing, Information Processing Letters, Vol. 60, No 2, pp. 9-103, 1996.
    • (1996) Information Processing Letters , vol.60 , Issue.2 , pp. 9-103
    • Eades, P.1    Stirk, C.2    Whitesides, S.3
  • 6
    • 0002574617 scopus 로고    scopus 로고
    • Three-Dimensional Orthogonal Graph Drawing Algorithms
    • P. Eades, A. Symvonis, S. Whitesides, Three-Dimensional Orthogonal Graph Drawing Algorithms, Discrete Applied Math., Vol. 103, pp. 55-87, 2000.
    • (2000) Discrete Applied Math. , vol.103 , pp. 55-87
    • Eades, P.1    Symvonis, A.2    Whitesides, S.3
  • 7
    • 0012782376 scopus 로고
    • About Realisation of Sets in 3-Dimensional Space
    • March
    • A. Kolmogorov, Y. Barzdin, About Realisation of Sets in 3-Dimensional Space, Problems in Cybernetics, Vol 8, pp. 261-268, March 1967.
    • (1967) Problems in Cybernetics , vol.8 , pp. 261-268
    • Kolmogorov, A.1    Barzdin, Y.2
  • 8
    • 0002830707 scopus 로고    scopus 로고
    • Incremental Orthogonal Graph Drawing in Three Dimensions
    • A. Papakostas, I. Tollis, Incremental Orthogonal Graph Drawing in Three Dimensions, J. of Graph Algorithms and Applications, Vol. 3, No. 4, pp. 81-115, 1999.
    • (1999) J. of Graph Algorithms and Applications , vol.3 , Issue.4 , pp. 81-115
    • Papakostas, A.1    Tollis, I.2
  • 9
    • 84957922647 scopus 로고    scopus 로고
    • An Algorithm for Three-Dimensional Orthogonal Graph Drawing
    • Lecture Notes in Computer Science 1547, Springer Verlag
    • D. Wood, An Algorithm for Three-Dimensional Orthogonal Graph Drawing, Symposium on Graph Drawing 98, Lecture Notes in Computer Science 1547, Springer Verlag, 1998. pp. 332-346.
    • (1998) Symposium on Graph Drawing 98 , pp. 332-346
    • Wood, D.1
  • 10
    • 84958981448 scopus 로고    scopus 로고
    • Multi-Dimensional Orthogonal Graph Drawing with Small Boxes
    • Lecture Notes in Computer Science 1731, Springer Verlag
    • D. Wood, Multi-Dimensional Orthogonal Graph Drawing with Small Boxes, Symposium on Graph Drawing 99, Lecture Notes in Computer Science 1731, Springer Verlag, 1999, pp. 311-322.
    • (1999) Symposium on Graph Drawing 99 , pp. 311-322
    • Wood, D.1
  • 11
    • 23044527401 scopus 로고    scopus 로고
    • Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
    • Lecture Notes in Computer Science 1984, Springer Verlag, Virginia, Sept.
    • D. Wood, Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings, Symposium on Graph Drawing 2000, Lecture Notes in Computer Science 1984, Springer Verlag, Virginia, Sept. 2000, pp. 259-271.
    • (2000) Symposium on Graph Drawing 2000 , pp. 259-271
    • Wood, D.1


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