Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference29 articles.
1. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606–635 (2004).
https://doi.org/10.1145/1008731.1008736
2. Bachmaier, C., Brandenburg, F.J., Brunner, W., Hofmeier, A., Matzeder, M., Unfried, T.: Tree drawings on the hexagonal grid. In: Proceedings of the 16th International Symposium on Graph Drawing (GD). Lecture Notes in Computer Science, vol. 5417, pp. 372–383. Springer, Berlin (2009).
https://doi.org/10.1007/978-3-642-00219-9_36
3. Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms 38(1), 91–109 (2001).
https://doi.org/10.1006/jagm.2000.1127
4. Biedl, T.: Ideal drawings of rooted trees with approximately optimal width. J. Graph Algorithms Appl. 21(4), 631–648 (2017).
https://doi.org/10.7155/jgaa.00432
5. Biedl, T.: Upward order-preserving 8-grid-drawings of binary trees. In: Proceedings of the 29th Canadian Conference on Computational Geometry (CCCG), pp. 232–237 (2017).
http://2017.cccg.ca/proceedings/Session6B-paper4.pdf
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献