Abstract
Rooted trees are usually drawn planar and upward, i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
Cite
CITATION STYLE
APA
Garg, A., Goodrich, M. T., & Tamassia, R. (1993). Area-efficient upward tree drawings. In Proceedings of the 9th Annual Symposium on Computational Geometry (pp. 359–368). Publ by ACM. https://doi.org/10.1145/160985.161165
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free