The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Information Processing Letters
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics
Proceedings of the 6th International Symposium on Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Proceedings of the 7th International Symposium on Graph Drawing
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Three Approaches to 3D-Orthogonal Box-Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Split&Push Approach to 3D Orthogonal Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An optimal bound for two dimensional bin packing
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Layout volumes of the hypercube
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provide lower bounds for three scenarios: (1) drawings where vertices have bounded aspect ratio, (2) drawings where the surface of vertices is proportional to their degree, and (3) drawings without any such restrictions. Then we give constructions that match the lower bounds in all scenarios within an order of magnitude.