论文信息 - Ideal Drawings of Rooted Trees With Approximately Optimal Width

Ideal Drawings of Rooted Trees With Approximately Optimal Width

For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether finding the minimum width is NPhard or polynomial. This paper gives a 2-approximation for this problem, and a 2∆-approximation (for ∆-ary trees) where additionally the height is O(n). For trees with ∆ ≤ 3, the former algorithm finds ideal drawings with minimum width. Submitted: August 2016 Reviewed: January 2017 Revised: February 2017 Accepted: April 2017 Final: April 2017 Published: April 2017 Article type: Regular paper Communicated by: G. Liotta Research supported by NSERC. E-mail address: biedl@uwaterloo.ca (Therese Biedl) 632 T. Biedl Ideal Tree-Drawings

Therese C. Biedl

[1] Ashim Garg,et al. Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees , 2003, Int. J. Comput. Geom. Appl..

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

[3] Therese C. Biedl,et al. Height-Preserving Transformations of Planar Graph Drawings , 2014, GD.

[4] Hiroshi Nagamochi,et al. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.

[5] Giuseppe Di Battista,et al. A Survey on Small-Area Planar Graph Drawing , 2014, ArXiv.

[6] Therese Biedl. Optimum-width upward drawings of trees , 2015 .

[7] Md. Saidur Rahman,et al. Minimum-Layer Upward Drawings of Trees , 2010, J. Graph Algorithms Appl..

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

[9] János Pach,et al. Monotone drawings of planar graphs , 2002, J. Graph Theory.