Two algorithms for three dimensional orthogonal graph drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1190, Issue , 1997, Pages 139-154

  Eades, Peter ^a   Symvonis, Antonios ^b   Whitesides, Sue ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); ECONOMIC AND SOCIAL EFFECTS; GRAPH THEORY; IMAGE SEGMENTATION;

3-DIMENSIONAL; BASIC RESULTS; BOUNDING BOX; GRID DRAWING; MAXIMUM DEGREE; N-VERTEX GRAPH; ORTHOGONAL GRAPHS; ORTHOGONAL GRID DRAWINGS;

ALGORITHMS;

EID: 84957681868     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_44     Document Type: Conference Paper

References (26)

1. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.
2. S. Bhatt, S. Cosmadakis, “The Complexity of Minimizing Wire Lengths in VLSI Layouts”, Information Processing Letters, Vol. 25, 1987, pp. 263-267.
3. T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993.
4. ndEuropean Symposium on Algorithms (ESA ’94), Lecture Notes in Computer Science, Vol. 855, Springer Verlag, 1994, pp. 24-35.
5. T. Biedl, “New Lower Bounds for Orthogonal Graph Drawings”, Graph Drawing, Lecture Notes in Computer Science, Vol. 1027, Springer Verlag, 1995, pp. 28-39.
6. J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, North Holland, Amsterdam, 1976.
7. G. DiBattista, P. Eades, R. Tamassia, I. Tollis, “Algorithms for Drawing Graphs: An Annotated Bibliography”, Computational Geometry: Theory and Applications, Vol. 4, 1994, pp. 235-282.
8. D. Dolev, F. T. Leighton, H. Trickey, “Planar Embeddings of Planar Graphs”, Advances in Computing Research 2 (ed. F. P. Preparata), JAI Press Inc., Greenwich CT, USA, 1984, pp. 147-161.
9. P. Eades, C. Stirk, S. Whitesides, The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawings, TR 95-07, Dept, of Computer Science, University of Newcastle NSW, Australia, October 1995.
10. Shimon Even, Graph Algorithms, Computer Science Press, 1979.
11. S. Even and G. Granot, “Rectilinear Planar Drawings with Few Bends in Each Edge”, Technical Report 797, Computer Science Department, Technion, 1994.
12. A. Garg, R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, TR CS-94-10, Dept, of Computer Science, Brown University, 1994.
13. P. Hall, “On Representation of Subsets”, J. London Mathematical Society, Vol. 10, 1935, pp. 26-30.
14. 5/2Algorithm for Maximum Matchings in Bipartite Graphs”, SIAM J. Comput., Vol. 2 (4), 1973, pp. 225-231.
15. rdIEEE Symp. on Foundations of Computer Science, 1992, pp. 101-110.
16. A. N. Komolgorov, Ya. M. Bardzin, “About Realisation of Sets in in 3-Dimensional Space”, Problems in Cybernetics, March 1967, pp. 261-268.
17. A. Papakostas and I. Tollis, “A Pairing Technique for Area-Efficient Orthogonal Drawings”, these proceedings.
18. F. P. Preparata, “Optimal Three-Dimensional VLSI Layouts”, Mathematical Systems Theory, Vol. 16, 1983, pp.1-8.
19. A. L. Rosenberg, “Three-Dimensional Integrated Circuitry”, Advanced Research in VLSI (eds. Kung, Sproule, Steele), 1981, pp. 69-80.
20. A. L. Rosenberg, “Three-Dimensional VLSI: A Case Study”, Journal of the ACM, Vol. 30 (3), 1983, pp. 397-416.
21. Markus Schaffter, “Drawing Graphs on Rectangular Grids”, Discrete Applied Math. Vol. 63, 1995, pp. 75-89.
22. R. Tamassia, “On Embedding a Graph in the Grid with a Minimum Number of Bends”, SIAM J. Comput., Vol. 16 (3), 1987, pp. 421-443.
23. R. Tamassia and I. Tollis, “A Unified Approach to Visibility Representations of Planar Graphs”, Discrete and Computational Geometry, Vol. 1, 1986, pp. 321-341.
24. R. Tamassia and I. Tollis, “Efficient Embeddings of Planar Graphs in Linear Time”, IEEE Symposium on Circuits and Systems, 1987, pp. 495-498.
25. R. Tamassia and I. Tollis, “Planar Grid Embedding in Linear Time”, IEEE Transactions on Circuits and Systems, Vol. 36 (9), 1989, pp. 1230-1234.
26. David Wood, “On Higher-Dimensional Orthogonal Graph Drawing”, manuscript, 1996, Dept, of Computer Science, Monash U.