Issue No. 04 - July/August (1990 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/52.56447
<p>A tree-drawing algorithm that addresses the weaknesses of current approaches to constructing graphical user interfaces is presented. Present algorithms either do not let you draw tree nodes of varying shapes and sizes or they draw such trees in a way that does not produce trees as compact as they could be, which is especially important when diagramming a large system. Also, they cannot reuse layout information when the trees changes, so after every change the layout must be recomputed and the tree redrawn. The main difference between these traditional approaches and the author's approach is that his algorithm is more geometric. Unlike other algorithms, it uses an explicit representation of node and subtree contours, and it stores every contour as a polygon. It has three advantages over traditional algorithms. It allows one to draw trees with nodes of any polygonal shape compactly. The data structure supports insert and delete operations on subtrees. It is simple to implement, yet flexible.</p>
geometric algorithm; node contours; dynamic trees; tree-drawing algorithm; graphical user interfaces; explicit representation; subtree contours; polygonal shape; data structure; insert; delete; subtrees; computer graphics; trees (mathematics); user interfaces
S. Moen, "Drawing Dynamic Trees," in IEEE Software, vol. 7, no. , pp. 21-28, 1990.