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
|
| _version_ | 1797095042684289024 |
|---|---|
| author | Gibbons, J |
| author_facet | Gibbons, J |
| author_sort | Gibbons, J |
| collection | OXFORD |
| description | 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, there is essentially only one reasonable drawing algorithm satisfying the criteria; its development is almost mechanical. <p> 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.</p> |
| first_indexed | 2024-03-07T04:22:23Z |
| format | Conference item |
| id | oxford-uuid:cb74b627-1dbe-425a-938b-dc9df5cf655c |
| institution | University of Oxford |
| last_indexed | 2024-03-07T04:22:23Z |
| publishDate | 1994 |
| publisher | Department of Computer Science‚ University of Auckland |
| record_format | dspace |
| spelling | oxford-uuid:cb74b627-1dbe-425a-938b-dc9df5cf655c2022-03-27T07:14:54ZHow to Derive Tidy Drawings of TreesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:cb74b627-1dbe-425a-938b-dc9df5cf655cDepartment of Computer ScienceDepartment of Computer Science‚ University of Auckland1994Gibbons, JThe 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, there is essentially only one reasonable drawing algorithm satisfying the criteria; its development is almost mechanical. <p> 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.</p> |
| spellingShingle | Gibbons, J How to Derive Tidy Drawings of Trees |
| title | How to Derive Tidy Drawings of Trees |
| title_full | How to Derive Tidy Drawings of Trees |
| title_fullStr | How to Derive Tidy Drawings of Trees |
| title_full_unstemmed | How to Derive Tidy Drawings of Trees |
| title_short | How to Derive Tidy Drawings of Trees |
| title_sort | how to derive tidy drawings of trees |
| work_keys_str_mv | AT gibbonsj howtoderivetidydrawingsoftrees |