C.-S. Shin, S. K. Kim, and K.-Y. Chwa. Area-efficient algorithms for upward straight-line tree drawings. In Proc. 2nd Int. Computing and Combinatorics Conf. (COCOON'96), Lect. Notes in Comput. Sci., vol. 1090, Springer-Verlag, pages 106--116, 1996.  Home/Search   Document Details and Download   Summary   Related Articles

....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 ....

.... 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 unstudied before. One may insist on an even stronger condition where the curves are not only monotone increasing decreasing in the x direction, but strictly increasing decreasing. ....

[Article contains additional citation context not shown here]

C.-S. Shin, S. K. Kim, and K.-Y. Chwa. Area-efficient algorithms for upward straight-line tree drawings. In Proc. 2nd Int. Computing and Combinatorics Conf. (COCOON'96), Lect. Notes in Comput. Sci., vol. 1090, Springer-Verlag, pages 106--116, 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