Three-Dimensional Drawings of Bounded Degree Trees
We show an algorithm for constructing 3D straight-line drawings of balanced constant degree trees. The drawings have linear volume and optimal aspect ratio. As a side effect, we also give an algorithm for constructing 2D drawings of balanced constant degree trees in linear area, with optimal aspect ratio and with better angular resolution with respect to the one of . Further, we present an algorithm for constructing 3D poly-line drawings of trees whose degree is bounded by n 1/3 in linear volume and with optimal aspect ratio.
- 7.Garg, A., Rusu, A.: Straight-line drawings of general trees with linear area and arbitrary aspect ratio. In: Kumar, V., Gavrilova, M., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2669, pp. 876–885. Springer, Heidelberg (2003)Google Scholar