Straight-Line Orthogonal Drawings of Binary and Ternary Trees
In this paper we provide upper and lower bounds on the area requirement of straight-line orthogonal drawings of n-node binary and ternary trees. Namely, we show algorithms for constructing order-preserving straight-line orthogonal drawings of binary trees in O(n 1.5) area, straight-line orthogonal drawings of ternary trees in O(n 1.631) area, and straight-line orthogonal drawings of complete ternary trees in O(n 1.262) area. As far as we know, the ones we present are the first algorithms achieving sub-quadratic area for these problems. Further, for upward order-preserving straight-line orthogonal drawings of binary trees and for order-preserving straight-line orthogonal drawings of ternary trees we provide Ω(n 2) area lower bounds, that we also prove to be tight.
- 5.Dolev, D., Trickey, H.W.: On linear area embedding of planar graphs. Technical report, Stanford, USA (1981)Google Scholar
- 8.Garg, A., Rusu, A.: Straight-line drawings of general trees with linear area and arbitrary aspect ratio. In: ICCSA, vol. (3), pp. 876–885 (2003)Google Scholar
- 9.Kim, S.K.: Simple algorithms for orthogonal upward drawings of binary and ternary trees sung. In: CCCG, pp. 115–120 (1995)Google Scholar
- 10.Shiloach, Y.: Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute for Science (1976)Google Scholar