Three-Dimensional Graph Drawing

Algorithmica (New York)

Volumn 17, Issue 2, 1997, Pages 199-208

  Cohen, R F ^a   Eades, P ^a   Lin, Tao ^b   Ruskey, F ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b CSIRO   (Australia)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Algorithms; Graph drawing; Three dimensional

Indexed keywords

EID: 0003185454     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02522826     Document Type: Article

References (22)

1. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display in drawing graphs. Proc. ACM Symp. on Computational Geometry, pages 51-60, 1989.
2. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete and Computational Geometry, 7:38-401, 1992.
3. J. A. Bondy and U. S. R, Murty. Graph Theory with Applications. North-Holland, New York, 1976.
4. P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings, of binary trees. Technical Report 11.91, Dipartimento di Informatica e Sistemistica, Univ. di Roma "La Sapienza," 1991.
5. P. Eades, T. Lin, and X. Lin. Minimum size h-v drawings. In Advanced Visual Interfaces (Proceedings of AVI 92, Rome), World Scientific Series in Computer Science, volume 36, pages 386-394, 1992.
6. P. Eades, T. Lin, and X. Lin. Two tree drawing conventions. International Journal of Computational Geometry and Applications, 3(2):133-153, 1993.
7. P. Eades, C. Stirk, and S. Whitesides. The techniques of Kologorov and Barzdin for three-dimensional orthogonal graph drawing. Information Processing Letters, to appear.
8. J. D. Foley and A. van Dam. Fundamentals of Interactive Computer Graphics. Addison-Wesley, Reading, MA, 1982.
9. A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. Proc. ACM Symp. on Computational Geometry, pages 359-368, 1993.
10. D. Knuth, The Art of Computer Programming. Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, 1997.
11. J. Mackinley, G. Robertson, and S. Card. Cone trees: Animated 3d visualizations of hierarchical information. Proceedings of SIGCHI Conference on Human Factors in Computing, pages 189-194, 1991.
12. S. Moen. Drawing dynamic trees. IEEE Software, 7:21-8, 1990.
13. P. Reid. Dynamic interactive display of complex data structures. In Graphics Tools for Software Engineers, pages 60-62. Cambridge University Press, Cambridge. 1989.
14. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering 7(2):223-228, 1981.
15. R. Tamassia. Planar orthogonal drawings of graphs. Proc. IEEE Internat. Symp. on Circuits and Systems, pages 319-322, 1990.
16. W. T. Tutte. Convex representations of graphs. Proceedings London Mathematical Society, 10:304-320, 1960.
17. O. Tversky, S. Snibbe, and R. Zeleznik. Cone trees in the uga graphics system: Suggestions of a more robust visualization tool. Technical Report CS-93-07, Brown University, 1993.
18. J. Vaucher. Pretty printing of trees. Software - Practice and Experience, 10(7):553-561, 1980.
19. J. Q. Walker II. A node-positioning algorithm for general trees. Software - Practice and Experience, 20(7):685-705, 1990.
20. C. Ware, D. Hui, and G. Franck. Visualizing object oriented software in three dimensions. CASCON 1993 Proceedings, 1993.
21. C. Wetherell and A. Shannon. Tidy drawing of trees. IEEE Transactions on Software Engineering, 5(5): 514-520, 1979.
22. N. Wirth. Systematic Programming: An Introduction. Prentice-Hall. Englewood Cliffs, NJ, 1973.