A Note on Minimum-Area
Upward Drawing of Complete and Fibonacci Trees.
Information Processing Letters, 57(5):231-236, 1996.
- We study the area requirement for
grid drawing of complete and
Fibonacci tree. We prove that a complete tree with
n nodes can be drawn in n + o(n) area,
and a Fibonacci tree with n nodes can be drawn in 1.17n + o(n)