Abstract
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 construc- tions that match the lower bounds in all scenarios within an order of magnitude.
Cite
CITATION STYLE
Biedl, T., Thiele, T., & Wood, D. R. (2001). Three-dimensional orthogonal graph drawing with optimal volume. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1984, pp. 284–295). Springer Verlag. https://doi.org/10.1007/3-540-44541-2_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
