Optimal three-dimensional orthogonal graph drawing in the general position model

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 151-178

  Wood, David R ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Graph algorithm; Graph drawing; Orthogonal; Three dimensional

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS);

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0037453393     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00044-0     Document Type: Article

References (40)

1. Aggarwal A., Klawe M., Shor P. Multilayer grid embeddings for VLSI. Algorithmica. 6(1):1991;129-151.
2. Alt H., Godau M., Whitesides S. Universal 3-dimensional visibility representations for graphs. Comput. Geom. 9:1998;111-125.
3. B. Baetz, D.R. Wood, Brooks' vertex-colouring theorem in linear time, See Technical Report CS-AAG-2001-05, Basser Department of Computer Science, The University of Sydney, 2001, submitted for publication.
4. T.C. Biedl, Heuristics for 3D-orthogonal graph drawings, Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, Universiteit Twente, Netherlands, 1995, pp. 41-44.
5. Biedl T.C. Three approaches to 3D-orthogonal box-drawings. Whitesides S. Proc. 6th Internat. Symp. on Graph Drawing (GD'98). Lecture Notes in Computer Science. Vol. 1547:1998;30-43 Springer, Berlin.
6. T. Biedl, T. Chan, Cross-coloring: improving the technique by Kolmogorov and Barzdin, Technical Report CS-2000-13, Department of Computer Science, University of Waterloo, Canada, 2000.
7. T. Biedl, T. Chan, Y. Ganjali, M. Hajiaghayi, D.R. Wood, Balanced vertex-orderings of graphs, Technical Report CS-AAG-2001-01, Basser Department of Computer Science, The University of Sydney, Australia, 2001.
8. Biedl T., Johansen J.R., Shermer T., Wood D.R. Orthogonal drawings with few layers. Mutzel P., Jünger M., Leipert S. Proc. 9th Internat. Symp. on Graph Drawing (GD'01). Lecture Notes in Computer Sci. Vol. 2265:2002;297-311 Springer, Berlin.
9. Biedl T., Thiele T., Wood D.R. Three-dimensional orthogonal graph drawing with optimal volume. Marks J. Proc. 8th Internat. Symp. on Graph Drawing (GD'00). Lecture Notes in Computer Science. Vol. 1984:2001;284-295 Springer, Berlin.
10. Bose P., Everett H., Fekete S., Houle M., Lubiw A., Meijer H., Romanik K., Rote G., Shermer T., Whitesides S., Zelle C. A visibility representation for graphs in three dimensions. J. Graph Algorithms Appl. 2(3):1998;1-16.
11. Brooks R.L. On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37:1941;194-197.
12. M. Chrobak, M. Goodrich, R. Tamassia, Convex drawings of graphs in two and three dimensions, Proc. 12th Annual ACM Symp. on Computational Geometry, ACM, New York, 1996, pp. 319-328.
13. Closson M., Gartshore S., Johansen J., Wismath S.K. Fully dynamic three-dimensional orthogonal graph drawing. J. Graph Algorithms Appl. 5(2):2001;1-34.
14. Cohen R.F., Eades P., Lin T., Ruskey F. Three-dimensional graph drawing. Algorithmica. 17(2):1996;199-208.
15. Di Battista G., Eades P., Tamassia R., Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs. 1999;Prentice-Hall, Englewood Cliffs, NJ.
16. Di Battista G., Patrignani M., Vargiu F. A split & push approach to 3D orthogonal drawing. J. Graph Algorithms Appl. 4(3):2000;105-133.
17. P.F. Dietz, D.D. Sleator, Two algorithms for maintaining order in a list, Proc. 19th Annual ACM Symp. on Theory of Computing (STOC'87), ACM, New York, 1987, pp. 365-372.
18. Eades P., Feng Q.-W. Multilevel visualization of clustered graphs. North S. Proc. 4th Internat. Symp. on Graph Drawing (GD'96). Lecture Notes in Computer Science. Vol. 1190:1997;101-112 Springer, Berlin.
19. Eades P., Garvan P. Drawing stressed planar graphs in three dimensions. Brandenburg F.J. Proc. Internat. Symp. on Graph Drawing (GD'95). Lecture Notes in Computer Science. Vol. 1027:1996;212-223 Springer, Berlin.
20. Eades P., Stirk C., Whitesides S. The techniques of Kolmogorov and Barzdin for three dimensional orthogonal graph drawings. Inform. Proc. Lett. 60(2):1996;97-103.
21. Eades P., Symvonis A., Whitesides S. Two algorithms for three dimensional orthogonal graph drawing. North S. Proc. 4th Internat. Symp. on Graph Drawing (GD'96). Lecture Notes in Computer Science. Vol. 1190:1997;139-154 Springer, Berlin.
22. Eades P., Symvonis A., Whitesides S. Three dimensional orthogonal graph drawing algorithms. Discrete Applied Math. 103:2000;55-87.
23. Garg A., Tamassia R., Vocca P. Drawing with colors. Diaz J., Serna M. Proc. 4th Annual European Symp. on Algorithms (ESA'96). Lecture Notes in Computer Science. Vol. 1136:1996;12-26 Springer, Berlin.
24. P.L. Garvan, Drawing and labelling graphs in three-dimensions, in: M. Patel (Ed.), Proc. 20th Australasian Comput. Sci. Conf. (ACSC'97), Australian Computer Science Commissions, Vol. 19 (1), Macquarie University, 1997, pp. 83-91.
25. Kazarinoff N.D. Analytic Inequalities. 1961;Holt, Rinehart and Winston, New York.
26. Kolmogorov A.N., Barzdin Y.M. On the realization of nets in 3-dimensional space. Problems Cybernetics. 8:1967;261-268.
27. Lovász L. Three short proofs in graph theory. J. Combin. Theory Ser. B. 19:1975;269-271.
28. Lynn B.Y.S., Symvonis A., Wood D.R. Refinement of three-dimensional orthogonal graph drawings. North S. Proc. 4th Internat. Symp. on Graph Drawing (GD'96). Lecture Notes in Computer Science. Vol. 1190:1997;308-320 Springer, Berlin.
29. Pach J., Thiele T., Toth G. Three-dimensional grid drawings of graphs. Di Battista G. Proc. 5th Internat. Symp. on Graph Drawing (GD'97). Lecture Notes in Computer Science. Vol. 1353:1998;47-51 Springer, Berlin.
30. Papakostas A., Tollis I.G. Improved algorithms and bounds for orthogonal drawings. Tamassia R., Tollis I.G. Proc. DIMACS Internat. Workshop on Graph Drawing (GD'94). Lecture Notes in Computer Science. Vol. 894:1995;40-51 Springer, Berlin.
31. Papakostas A., Tollis I.G. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl. 3(4):1999;81-115.
32. Patrignani M. On the complexity of orthogonal compaction. Comput. Geom. 19(1):2001;47-67.
33. Patrignani M., Vargiu F. 3DCube: a tool for three dimensional graph drawing. Di Battista G. Proc. 5th Internat. Symp. on Graph Drawing (GD'97). Lecture Notes in Computer Science. Vol. 1353:1998;284-290 Springer, Berlin.
34. Rosenberg A.L. Three-dimensional VLSI: a case study. J. ACM. 30(2):1983;397-416.
35. Ware C., Franck G. Viewing a graph in a virtual reality display is three times as good as a 2D diagram. Ambler A.L., Kimura T.D. Proc. IEEE Symp. Visual Languages (VL'94). 1994;182-183 IEEE, Los Alamitos, CA.
36. Ware C., Franck G. Evaluating stereo and motion cues for visualizing information nets in three dimensions. ACM Trans. Graphics. 15(2):1996;121-140.
37. D.R. Wood, On higher-dimensional orthogonal graph drawing, in: J. Harland (Ed.), Proc. Computing: the Australasian Theory Symposium (CATS'97), Vol. 19(2), Australian Computer Science Commission, 1997, pp. 3-8.
38. D.R. Wood, Three-dimensional orthogonal graph drawing, School of Computer Science and Software Engineering, Ph.D. Thesis, Monash University, Melbourne, Australia, 2000.
39. Wood D.R. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings. Marks J. Proc. 8th Internat. Symp. on Graph Drawing (GD'00). Lecture Notes in Computer Science. Vol. 1984:2001;259-271 Springer, Berlin.
40. D.R. Wood, Minimising the number of bends and volume in three-dimensional orthogonal graph drawings with a diagonal vertex layout, See Technical Report CS-AAG-2001-03, Basser Department of Computer Science, The University of Sydney, 2001, submitted for publication.