The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings

Information Processing Letters

Volumn 60, Issue 2, 1996, Pages 97-103

  Eades, Peter ^a   Stirk, Charles ^c   Whitesides, Sue ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b MCGILL UNIVERSITY   (Canada)

^c NONE

Author keywords

Algorithms; Computational geometry; Graph algorithms; Graph drawing

Indexed keywords

KOLMOGOROV/BARDZIN TECHNIQUES; THREE DIMENSIONAL ORTHOGONAL GRAPH DRAWINGS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DRAWING (GRAPHICS); EDGE DETECTION; PROBLEM SOLVING; THEOREM PROVING;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0030260127     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00133-0     Document Type: Article

References (25)

1. C. Batini, E. Nardelli, M. Talamo and R. Tamassia, A graph-theoretic approach to aesthetic layout of information systems diagrams, in: Proc. 10th Internat. Workshop on Graph-theoretic Concepts in Computer Science, Berlin (Trauner, 1984) 9-18.
2. S. Bhatt and S. Cosmodakis, The complexity of minimizing wire lengths in VLSI layouts, Inform. Process. Lett. 25 (1987) 263-267.
3. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, Amsterdam, 1976).
4. F.J. Brandenburg, Nice drawings of graphs and trees are computationally hard, Tech. Rept. TR MIP-8820, U. of Passau, 1988.
5. I. Bruss and A. Frick, Fast interactive 3D graph visualization, in: Graph Drawing, Lecture Notes in Computer Science 1027 (Springer, Berlin, 1995) 99-110.
6. R. Cohen, P. Eades, T. Lin and F. Ruskey, Three-dimensional graph drawing, in: Graph Drawing, Lecture Notes in Computer Science 894 (Springer, Berlin, 1995) 1-11; also in: Algorithmica, to appear.
7. I. Cruz and J. Twarog, 3D graph drawing with simulated annealing, in: Graph Drawing, Lecture Notes in Computer Science 1027 (Springer, Berlin, 1995) 162-165.
8. G. Das and M. Goodrich, On the complexity of approximating and illuminating three-dimensional convex polyhedra, in: Proc. WADS 1995, to appear.
9. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Algorithms for drawing graphs: An annotated bibliography, Comput. Geom. Theory Appl. 4 (1994) 235-282.
10. D. Dolev, F.T. Leighton and H. Trickey, Planar embedding of planar graphs, in: F.P. Preparata, ed., Advances in Computing Research, Vol. 2 (JAI Press, Greenwich, CT, 1984) 147-161.
11. P. Eades and P. Garvan, Drawing stressed planar graphs in three dimensions, in: Graph Drawing, Lecture Notes in Computer Science 1027 (Springer, Berlin, 1995) 212-223.
12. S. Fekete, M. Houle and S. Whitesides, New results on visibility representation of graphs in 3D, in: Graph Drawing, Lecture Notes in Computer Science 1027 (Springer, Berlin, 1995) 234-241.
13. A.N. Komolgorov and Ya.M. Bardzin, About realization of sets in 3-dimensional space, Problems in Cybernetics (March 1967) 261-268.
14. M.R. Garey and D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (3) (1983) 312-316.
15. A. Garg and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, in: Graph Drawing, Lecture Notes in Computer Science 894 (Springer, Berlin, 1995) 286-297.
16. H. Koike, An application of three dimensional visualization to object-oriented programming, in: Proc. Advanced Visual Interfaces (AVI 92), World Scientific Series in Computer Science 36 (World Scientific, Singapore, 1992) 180-192.
17. J.A. McHugh, Algorithmic Graph Theory (Prentice Hall, Englewood Cliffs, NJ, 1990).
18. J. Mackinley, G. Robertson and S. Card, Cone trees: Animated 3D visualizations of hierarchical information, in: Proc. SIGCHI Conf. on Human Factors in Computing (1991) 189-194.
19. K. Miriyala, S.W. Hornick and R. Tamassia, An incremental approach to aesthetic graph layout, in: Proc. Internat. Workshop on Computer-Aided Software Engineering (CASE '93) (1993).
20. F.P. Preparata, Optimal three-dimensional VLSI layouts, Math. Systems Theory 16 (1983) 1-8.
21. S.P. Reiss, A framework for abstract 3d visualization, in: Proc. IEEE Symp. on Visual Languages (VL '93) (1993).
22. A.L. Rosenberg, Three dimensional integrated circuitry, in: Kung, Sproule and Steele, eds., Advanced Research in VLSI (1981) 69-80.
23. A.L. Rosenberg, Three dimensional VLSI: A case study, J. ACM 30 (3) (1983) 397-416.
24. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987) 421-444.
25. C. Ware, D. Hui and G. Franck, Visualizing object oriented software in three dimensions, in: Proc. CASCON 93 (1993).