Three-dimensional grid drawings of graphs
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is shown that for any fixed r ≥ 2, every r-colorable graph of n vertices has a three-dimensional grid drawing that fits into a box of volume O(n2). The order of magnitude of this bound cannot be improved.
- [CE]R.F. Cohen, P. Eades, T. Lin, and F. Ruskey, Three-dimensional graph drawing, in: Graph Drawing (GD '94, R. Tamassia and I.G. Tollis, eds.), Lecture Notes in Computer Science 1027, Springer-Verlag, Berlin, 1995, 1–11.Google Scholar
- [CS]T. Calamoneri and A. Sterbini, Drawing 2-, 3-, and 4-colorable graphs in O(n 2) volume, in: Graph Drawing (GD '96, S. North, ed.), Lecture Notes in Computer Science 1190, Springer-Verlag, Berlin, 1997, 53–62.Google Scholar
- [HW]G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers, University Press, Oxford, 1954.Google Scholar
- [MR]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, 1991, 189–194.Google Scholar
- [S]W. Schnyder, Embedding planar graphs on the grid, in: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, 138–148.Google Scholar