Three-dimensional orthogonal graph drawing algorithms

Discrete Applied Mathematics

Volumn 103, Issue 1-3, 2000, Pages 55-87

  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

Graph colouring; Graph drawing; Graph theory; Layout

Indexed keywords

EID: 0002574617     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00172-4     Document Type: Article

References (34)

1. Berge C. Graphs. 2nd revised Edition:1985;North-Holland, Amsterdam.
2. Bhatt S., Cosmadakis S. The Complexity of Minimizing Wire Lengths in VLSI Layouts. Inform. Process. Lett. 25:1987;263-267.
3. T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993.
4. Biedl T., Kant G. A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl. 9(3):1998;159-180.
5. T. Biedl, New lower bounds for orthogonal graph drawings, Graph Drawing, Lecture Notes in Computer Science, Vol. 1027, Springer, Berlin, 1995, pp. 28-39.
6. T. Biedl, T. Shermer, S. Whitesides, S. Wismath, Orthogonal 3D graph drawing, in: GD97, Lecture Notes in Computer Science, Vol. 1353, Springer, Berlin, 1998, 76-86.
7. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;North Holland, Amsterdam.
8. DiBattista G., Eades P., Tamassia R., Tollis I. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl. 4:1994;235-282.
9. D. Dolev, F.T. Leighton, H. Trickey, Planar Embeddings of Planar Graphs, in: F.P. Preparata (Ed.), Advances in Computing Research 2, JAI Press Inc., Greenwich CT, USA, 1984, pp. 147-161.
10. Eades P., Stirk C., Whitesides S. The techniques of Komolgorov and Barzdin for three dimensional orthogonal graph drawings. Inform. Process. Lett. 60(2):1996;97-103.
11. Eades P., Symvonis A., Whitesides S. Two algorithms for three dimensional orthogonal graph drawing. North S. GD96. Springer Lecture Notes in Computer Science. Vol. 1190:1996;139-154 Springer, Berlin.
12. Even S. Graph Algorithms. 1979;Computer Science Press, Rockville, MD.
13. S. Even, G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Technical Report 797, Computer Science Department, Technion, 1994.
14. M. Formann, F. Wagner, The VLSI layout problem in various embedding models, in: WG91, Lecture Notes in Computer Science, Vol. 484, Springer, Berlin, 1991, 130-139.
15. A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proceedings of the Graph Drawing: DIMACS International Workshop (GD'94), Lecture Notes in Computer Science, Vol. 894, Springer, Berlin, 1995, pp. 286-297.
16. Hall P. On representation of subsets. J. London Math. Soc. 10:1935;26-30.
17. Johnson D.S., Demers A., Ullman J.D., Garey M.R., Graham R.L. Worst-case Performance Bounds for Simple One-dimensional Packing Algorithms. SIAM J. Comput. 3:1974;299-325.
18. Kant G. Drawing planar graphs using the canonical ordering. Algorithmica. 16(1):1996;4-32.
19. Kolmogorov A.N., Barzdin Ya.M. About realisation of sets in 3-dimensional space. Problems Cybernet. 1967;261-268.
20. M. Kramer, J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits, in: F. Preparata (Ed.), Advances in Computing Research, Vol. 2 (VLSI Theory), 1984, 129-146.
21. Papakostas A., Tollis I. Algorithms for area-efficient orthogonal drawings. Comput. Geom. Theory Appl. 9(1-2):1998;83-110.
22. A. Papakostas, I. Tollis, Incremental orthogonal graph drawing in three dimensions, in: GD97, Lecture Notes in Computer Science, Vol. 1353, Springer, Berlin, 1998, pp. 52-63.
23. Petersen J. Die theorie der regulären graphen. Acta Math. 15:1891;193-220.
24. Preparata F.P. Optimal three-dimensional VLSI layouts. Math. Systems Theory. 16:1983;1-8.
25. A.L. Rosenberg, Three-dimensional integrated circuitry, in: Kung, Sproule, Steele (Eds.), VLSI Systems and Computations, Computer Science Press, 1981, pp. 69-80.
26. L. Rosenberg A. Three-dimensional VLSI: a case study. J. ACM. 30(3):1983;397-416.
27. Schäffter M. Drawing graphs on rectangular grids. Discrete Appl. Math. 63:1995;75-89.
28. Schrijver A. Bipartite edge-coloring in. O(Δ m) time SIAM J. Comput. 28(3):1998;841-846.
29. Storer J. On minimal node-cost planar embeddings. Networks. 14:1984;181-212.
30. Tamassia R. On embedding a graph in the grid with a minimum number of bends. SIAM J. Comput. 16(3):1987;421-443.
31. Tamassia R., Tollis I. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1:1986;321-341.
32. Tamassia R., Tollis I. Efficient embeddings of planar graphs in linear time. IEEE Symposium on Circuits and Systems. 1987;495-498.
33. Tamassia R., Tollis I. Planar grid embedding in linear time. IEEE Trans. Circuits and Systems. Vol. 36(9):1989;1230-1234.
34. D. Wood, On higher-dimensional orthogonal graph drawing, Proceedings of CATS'97, Computing: The Australasian Theory Symposium, February 1997, Sydney, Australia, pp. 3-8.