Three-Dimensional Orthogonal Graph Drawing with Optimal VolumeBiedl, Therese and Thiele, Torsten and Wood, David R. (2001) Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 284-295(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_27). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3-540-44541-2_27
AbstractIn 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.
Actions (login required)
|