Moen, S. (1987). Drawing Dynamic Trees. Technical Report LiTH-IDA-R-87-24, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: This paper describes the design and implementation of a layout algorithm for dynamic trees. The algorithm employs geometrical objects called tree contours and supports insert and delete operations on subtrees. Its worst-case running time is linear with respect to the number of tree nodes. The implementation is based on the useful family of string trees. An overview of a directory browser shows how the algorithm can be used in practice.
CS Dept TR Overview