An algorithm for three-dimensional orthogonal graph drawing

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

Volumn 1547, Issue , 1999, Pages 332-346

  Wood, David R ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957922647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_25     Document Type: Conference Paper

References (25)

1. H. Alt, M. Godau, and S. Whitesides. Universal 3-dimensional visibility representation for graphs. In F. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’95), volume 1027 of Lecture Notes in Comput. Sci., pages 8–19, Berlin, 1996. Springer.
2. T. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Orthogonal 3-D graph drawing. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 76–86, Berlin, 1998. Springer.
3. R.L. Brooks. On colouring the nodes of a network. Proc. Cambridge Philos. Soc., 37:194–197, 1941.
4. T. Calamoneri and A. Massini. On three-dimensional layout of interconnection networks. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 64–75, Berlin, 1998. Springer.
5. M. Chrobak, M. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annual ACM Symp. on Computational Geometry, pages 319–328, 1996.
6. R.F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17(2):199–208, 1996.
7. P. Eades and Q.-W. Feng. Multilevel visualization of clustered graphs. In S. North, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’96), volume 1190 of Lecture Notes in Comput. Sci., pages 101–112, Berlin, 1997. Springer.
8. P. Eades and P. Garvan. Drawing stressed planar graphs in three dimensions. In F. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’95), volume 1027 of Lecture Notes in Comput. Sci., pages 212–223, Berlin, 1996. Springer
9. P. Eades, C. Stirk, and S. Whitesides. The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings. Information Processing Lett., 60(2):97–103, 1996.
10. P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’96), volume 1190 of Lecture Notes in Comput. Sci., pages 139–154, Berlin, 1997. Springer.
11. P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. 1998, submitted.
12. S. Fekete, M. Houle, and S. Whitesides. New results on a visibility representation of graphs in 3D. In F. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’95), volume 1027 of Lecture Notes in Comput. Sci., pages 234–241, Berlin, 1996. Springer.
13. A. Garg, R. Tamassia, and P. Vocca. Drawing with colors. In Proc. 4th Annual European Symp. on Algorithms (ESA’96), volume 1136 of Lecture Notes in Comput. Sci., pages 12–26, Berlin, 1996. Springer.
14. P.L. Garvan. Drawing and labelling graphs in three-dimensions. In M. Patel, editor, Proc. 20th Australasian Comput. Sci. Conf. (ACSC’97), volume 19 (1) of Australian Comput. Sci. Comms., pages 83–91. Macquarie University, 1997.
15. H. Koike. An application of three-dimensional visualization to object-oriented programming. In Proc. Advanced Visual Interfaces (AVI’92), volume 36 of World Scientific Series in Comput. Sci., pages 180–192, 1992.
16. A.N. Kolmogorov and Ya. M. Barzdin. On the realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261–268, March 1967.
17. J. Pach, T. Thiele, and G. Toth. Three-dimensional grid drawings of graphs. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 47–51, Berlin, 1998. Springer.
18. A. Papakostas and I.G. Tollis. Incremental orthogonal graph drawing in three dimensions. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 52–63, Berlin, 1998. Springer.
19. M. Patrignani and F. Vargiu. 3DCube: a tool for three dimensional graph drawing. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 284–290, Berlin, 1998. Springer.
20. F.P. Preparata. Optimal three-dimensional VLSI layouts. Math. Systems Theory, 16:1–8, 1983.
21. S.P. Reiss. 3-D visualization of program information. In R. Tamassia and I. Tol-lis, editors, Proc. Graph Drawing: DIMACS International Workshop (GD’94), volume 894 of Lecture Notes in Comput. Sci., pages 12–24, Berlin, 1995. Springer.
22. A.L. Rosenberg. Three-dimensional VLSI: A case study. J. ACM, 30(2):397–416, 1983.
23. D.R. Wood. On higher-dimensional orthogonal graph drawing. In J. Harland, editor, Proc. Computing: the Australasian Theory Symp.(CATS’97), volume 19 (2) of Australian Comput. Sci. Comms., pages 3–8. Macquarie University, 1997.
24. D.R. Wood. Towards a 2-bends algorithm for three-dimensional orthogonal graph drawing. In V. Estivill-Castro, editor, Proc. Australasian Workshop on Combinatorial Algorithms (AWOCA’97), pages 102–107. Queensland University of Technology, 1997.
25. D.R. Wood. Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. Technical Report 98/03, School of Computer Science and Software Engineering, Monash University, 1998, available at ftp.csse.monash.edu.au.