Three-Dimensional Graph Drawing

Cohen, Robert F. and Eades, Peter and Lin, Tao and Ruskey, Frank (1995) Three-Dimensional Graph Drawing. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 1-11 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_351).

Full text not available from this repository.

Abstract

Graph drawing research has been mostly oriented toward two-dimensional drawings. This paper describes an investigation of fundamental aspects of three-dimensional graph drawing. In particular we give three results concerning the space required for three-dimensional drawings. We show how to produce a grid drawing of an arbitrary n-vertex graph with all vertices located at integer grid points, in an n \times 2n \times 2n grid, such that no pair of edges cross. This grid size is optimal to within a constant. We also show how to convert an orthogonal two-dimensional drawing in a H \times V integer grid to a three-dimensional drawing with \lceil \sqrt{H} \rceil \times \lceil \sqrt{H} \rceil \times V volume. Using this technique we show, for example, that three-dimensional drawings of binary trees can be computed with volume \lceil \sqrt{n} \rceil \times \lceil \sqrt{n} \rceil \times \lceil log n \rceil. We give an algorithm for producing drawings of rooted trees in which the z coordinate of a node represents the depth of the node in the tree; our algorithm minimizes the footprint of the drawing, that is, the size of the projection in the xy plane. Finally, we list significant unsolved problems in algorithms for three-dimensional graph drawing.

Item Type:Conference Paper
Additional Information:10.1007/3-540-58950-3_351
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.060 3D
ID Code:259

Repository Staff Only: item control page

References

G. Di Battista, R. Tamassia, and I.G. Tollis. Area requirement and symmetry display in drawing graphs. In Proc. ACM Symp. on Computational Geometry, pages 51-60, 1989.

G. Di Battista, R. Tamassia, and I.G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete and Computational Geometry, 7:381-401, 1992.

J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, New York, N.Y., 1976.

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.

H. de Fraysseix, J. Pach, and R. Pollack. Smal sets supporting fary embeddings of planar graphs. In Proc. 20th ACM Symp. on Theory of Computing, pages 426-433, 1988.

H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.

P.Eades, T. Lin, and X. Lin. Minimum size h-v drawings. In Advanced Visual Interface (Proceedings of AVI 92), volume 36 of World Scientific Series in Computer Science, pages 386-394, 1992.

P. Eades, T. Lin, and X. Lin. Two tree drawing conventions. International Journal of Computational Geometry and Applications, 3(2):133-153, 1993.

J.D. Foley and A. van Dam. Fundamentals of Interactive Computer Graphics. Addison-Wesley, Reading, Mass., 1982.

A. Garg, M.T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. ACM Symp. on Computational Geometry, 1993.

J.Q. Walker II. A node-positioning algorithm for general trees. Software-Practice and Experience, 20(7):685-705, 1990.

G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33th IEEE Symp. on Foundations of Computer Science, pages 101-110, 1992.

D. Knuth. The Art of Computer Programming Volume 1: Fundamental Algorithms. Addison Wesley, 1975.

J. Mackinley, G. Robertson, and S. Card. Cone trees: Animated 3d visualizations of hierarchical information. In Proceedings of SIGCHI Conference on Human Factors in Computing, pages 189-194, 1991.

S. Moen. Drawing dynamic trees. IEEE Software, 7:21-8, 1990.

P. Reid. Dynamic interactive display of complex data structures. In Graphics Tools for Software Engineers, pages 62-60. Cambridge, 1989.

E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering, SE-7(2):223-228, 1981.

W. Schnyder. Embedding planar graphs on the grid. In Proc. Fitrst ACM-SIAM Symp. on Discrete Algorithms, pages 138-148, 1990.

R. Tamassia. Planar orthogonal drawings of graphs. In Proc. IEEE Int. Symp. on Circuits and Systems, 1990.

W.T. Tutte. Convex representations of graphs. Proceedings London Mathematical Society, 10:304-320, 1960.

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.

J. Vaucher. Pretty printing of trees. Software - Practice and Experience, 10(7):553-561, 1980.

C. Ware, D. Hui, and G. Franck. Visualizing object oriented software in three dimensions. In CASCON 1993 Proceedings, 1993.

C. Wetherell and A. Shannon. Tidy drawing of trees. IEEE Transactions on Software Engineering, SE-5(5):514-520, 1979.

N. Wirth. Systematic Programming: An Introduction. Prentice Hall, 1973.