How to Derive Tidy Drawings of Trees
The tree-drawing problem\\/ is to produce a `tidy' mapping of elements of a tree to points in the plane. In this paper, we derive an efficient algorithm for producing tidy drawings of trees. The specification, the starting point for the derivations, consists of a collection of intuitively appe...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Published: |
Department of Computer Science‚ University of Auckland
1994
|