L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Inform. Process. Lett., 57(5):231-236, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Straight-line Drawings of Binary Trees with Linear Area and.. - Garg, Rusu (2002) (Correct)
....an orthogonal drawing of T in O(n) area. 7] gives an algorithm for constructing upward layered drawing in O(n ) area. 2] gives an algorithm for constructing strictly upward drawing drawing of T in O(n log n) area. If T is a Fibonacci tree, AVL tree, balanced tree, respectively) then [2, 10] ( 3] 2] respectively) give algorithms for constructing an strictly upward drawing of T in O(n) area. 4 Preliminaries In this section we give de nitions and some known results that will be used throughout the paper. Throughout this paper, by the term drawing, we will mean a planar ....
L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Inform. Process. Lett., 57(5):231-236, 1996.
A Near-Linear Area Bound for Drawing Binary Trees - Chan (2001) (7 citations) (Correct)
....worst case [5] Not in the table are results dealing with special types of trees. For most balanced trees (including the complete binary tree, the Fibonacci tree, AVL trees, and red black trees) ideal drawings satisfying all criteria 1 4 can be constructed using only O(n) area; see the references [3, 4, 7, 11, 13]. Also not in the table are results regarding orthogonal drawings, i.e. drawings in which all line segments are either horizontal or vertical; see the references [1, 2, 6, 8, 11, 14] 2 planar upward order preserv. straight line area references yes yes no no O(n) 6] yes yes no yes O(n log ....
L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Inform. Process. Lett., 57:231-236, 1996.
A Near-Linear Area Bound for Drawing Binary Trees - Chan (1999) (7 citations) (Correct)
....pleasing. Not in the table are results dealing with special types of trees. For most balanced trees (including the complete binary tree, the Fibonacci tree, AVL trees, and red black trees) ideal drawings satisfying all criteria 1 4 can be constructed using only O(n) area; see the references [3, 4, 7, 10, 12]. Also not in the table are results regarding orthogonal drawings, i.e. drawings in which all line segments are either horizontal or vertical; see the references [1, 2, 6, 8, 10, 13] Note that despite its naturalness, our strong definition of order preserving drawings (criterion 3) seems to be ....
L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Inform. Process. Lett., 57:231--236, 1996.
Optimizing Area and Aspect Ratio in Straight-Line.. - Chan, Goodrich, al. (1997) (1 citation) (Correct)
....class of drawings in Table 2. Class Drawing Type Area Aspect Ratio(s) Source rooted tree upward layered grid O(n 2 ) O(1) 8] rooted tree upward grid O(n log n) O(n= log n) 2, 9] rooted tree strictly upward grid Theta(n log n) O(n= log n) 2] complete or strictly upward grid Theta(n) O(1) [2, 10] Fibonacci tree AVL tree strictly upward grid Theta(n) log fi n) n; n= log fi n) 3] balanced tree of upward grid O(n log n) O(n= log n) 2, 9] height O(log n) Table 2. Summary of previous area aspect ratio results for planar straight line grid drawings. We use fi to denote an arbitrary ....
L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Information Processing Letters, 57(5):231--236, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC