Area-efficient algorithms for straight-line tree drawings

Abstract We investigate several straight-line drawing problems for bounded-degree trees in the integer grid without edge crossings under various types of drawings: (1) upward drawings whose edges are drawn as vertically monotone chains, a sequence of line segments, from a parent to its children, (2) order-preserving drawings which preserve the left-to-right order of the children of each vertex, and (3) orthogonal straight-line drawings in which each edge is represented as a single vertical or horizontal segment. Main contribution of this paper is a unified framework to reduce the upper bound on area for the straight-line drawing problems from O (n log n) (Crescenzi et al., 1992) to O (n loglog n) . This is the first solution of an open problem stated by Garg et al. (1993). We also show that any binary tree admits a small area drawing satisfying any given aspect ratio in the orthogonal straight-line drawing type. Our results are briefly summarized as follows. Let T be a bounded-degree tree with n vertices. Firstly, we show that T admits an upward straight-line drawing with area O (n loglog n) . If T is binary, we can obtain an O (n loglog n) -area upward orthogonal drawing in which each edge is drawn as a chain of at most two orthogonal segments and which has O (n/ log n) bends in total. Secondly, we present O (n loglog n) -area (respectively, -volume) orthogonal straight-line drawing algorithms for binary trees with arbitrary aspect ratios in 2-dimension (respectively, 3-dimension). Finally, we present some experimental results which shows the area requirements, in practice, for (order-preserving) upward drawing are much smaller than theoretical bounds obtained through analysis.

[1]  Tao Lin,et al.  Minimum Size h-v Drawings , 1992, Advanced Visual Interfaces.

[2]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[3]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[4]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[5]  Sung Kwon Kim.  Simple algorithms for orthogonal upward drawings of binary and ternary trees , 1995, CCCG.

[6]  Giuseppe Di Battista,et al.  A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..

[7]  Paolo Penna,et al.  Linear area upward drawings of AVL trees , 1998, Comput. Geom..

[8]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[9]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[11]  Tao Lin,et al.  Three-Dimensional Graph Drawing , 1994, Graph Drawing.

[12]  Kyung-Yong Chwa,et al.  Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract) , 1996, COCOON.

[13]  S. Teng,et al.  Optimal Tree Contraction in the EREW Model , 1988 .

[14]  Sung Kwon Kim.  Logarithmic Width, Linear Area Upward Drawing of AVL Trees , 1997, Inf. Process. Lett..

[15]  Michael T. Goodrich,et al.  Area-efficient upward tree drawings , 1993, SCG '93.

[16]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[17]  Kyung-Yong Chwa,et al.  Algorithms for Drawing Binary Trees in the Plane , 1998, Inf. Process. Lett..

[18]  Stuart C. Schwartz,et al.  Concurrent Computations: Algorithms, Architecture, and Technology , 1989 .

[19]  Paolo Penna,et al.  Strictly-upward Drawings of Ordered Search Trees , 1998, Theor. Comput. Sci..

[20]  Timothy M. Chan.  A Near-Linear Area Bound for Drawing Binary Trees , 1999, SODA '99.

[21]  L. Alonso,et al.  Random Generation of Trees , 1995, Springer US.

[22]  Charles E. Leiserson,et al.  Area-Efficient VLSI Computation , 1983 .

[23]  Timothy M. Chan,et al.  Optimizing area and aspect ration in straight-line orthogonal tree drawings , 2002, Comput. Geom..

[24]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[25]  Arnold L. Rosenberg,et al.  Three-Dimensional Circuit Layouts , 1984, SIAM J. Comput..