Conference item icon

Conference item

How to Derive Tidy Drawings of Trees

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, there is essentially only one reasonable drawing algorith...

Expand abstract

Actions


Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Department of Computer Science‚ University of Auckland
Host title:
Proceedings of Salodays in Auckland
Publication date:
1994-01-01
UUID:
uuid:cb74b627-1dbe-425a-938b-dc9df5cf655c
Local pid:
cs:2332
Deposit date:
2015-03-12

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP