How to Draw a Clustered Tree
暂无分享,去创建一个
[1] Giuseppe Di Battista,et al. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..
[2] Robert F. Cohen,et al. How to Draw a Planar Clustered Graph , 1995, COCOON.
[3] Timothy M. Chan,et al. Optimizing area and aspect ration in straight-line orthogonal tree drawings , 2002, Comput. Geom..
[4] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.
[5] Michael T. Goodrich,et al. Planar upward tree drawings with optimal area , 1996, Int. J. Comput. Geom. Appl..
[6] Hiroshi Nagamochi,et al. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.
[7] Luca Trevisan. A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees , 1996, Inf. Process. Lett..
[8] Ioannis G. Tollis,et al. Area requirement and symmetry display of planar upward drawings , 1992, Discret. Comput. Geom..
[9] Hiroshi Nagamochi,et al. Drawing Clustered Graphs on an Orthogonal Grid , 1999, J. Graph Algorithms Appl..
[10] Timothy M. Chan. A Near-Linear Area Bound for Drawing Binary Trees , 1999, SODA '99.