Author:
Chan Timothy M.,Huang Zhengcheng
Publisher
Springer International Publishing
Reference27 articles.
1. Bachmaier, C., Brandenburg, F., Brunner, W., Hofmeier, A., Matzeder, M., Unfried, T.: Tree drawings on the hexagonal grid. In: Proceedings of 16th International Symposium on Graph Drawing (GD), pp. 372–383 (2008). https://doi.org/10.1007/978-3-642-00219-9_36
2. Biedl, T.: Ideal drawings of rooted trees with approximately optimal width. J. Graph Algorithms Appl. 21, 631–648 (2017). https://doi.org/10.7155/jgaa.00432
3. Biedl, T.: Upward order-preserving 8-grid-drawings of binary trees. In: Proceedings of 29th Canadian Conference on Computational Geometry (CCCG), pp. 232–237 (2017)
4. Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica 34(1), 1–13 (2002). https://doi.org/10.1007/s00453-002-0937-x
5. Chan, T.M.: Tree drawings revisited. Discrete Comput. Geom. 63(4), 799–820 (2019). https://doi.org/10.1007/s00454-019-00106-w