## Deriving Tidy Drawings of Trees (1995)

### Cached

### Download Links

- [www.cs.auckland.ac.nz]
- [www.cs.auckland.ac.nz]
- [web.comlab.ox.ac.uk]
- [ftp.cs.auckland.ac.nz]
- DBLP

### Other Repositories/Bibliography

Citations: | 6 - 4 self |

### BibTeX

@MISC{Gibbons95derivingtidy,

author = {Jeremy Gibbons and Jeremy Gibbons},

title = {Deriving Tidy Drawings of Trees},

year = {1995}

}

### OpenURL

### Abstract

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 appealing criteria satisfied by tidy drawings. The derivation shows constructively that these criteria completely determine the drawing. Indeed, the criteria completely determine a simple but inefficient algorithm for drawing a tree, which can be transformed into an efficient algorithm using just standard techniques and a small number of inventive steps. The algorithm consists of an upwards accumulation followed by a downwards accumulation on the tree, and is further evidence of the utility of these two higher-order tree operations.