Show simple item record

Readable Layout of Unbalanced N-ary Trees

dc.date.accessioned2008-04-14T14:58:00Z
dc.date.accessioned2018-11-26T22:24:56Z
dc.date.available2008-04-14T14:58:00Z
dc.date.available2018-11-26T22:24:56Z
dc.date.issued1986-08
dc.identifier.urihttp://hdl.handle.net/1721.1/41166
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/41166
dc.description.abstractThe automatic layout of unbounded n-ary tree structures is a problem of subjectively meshing two independent goals: clarity and space efficiency. This paper presents a minimal set of subjective aesthetics which insures highly readable structures, without overly restricted flexibility in the layout of the tree. This flexibility underlies the algorithm's ability to produce readable trees with greater uniformity of node density throughout the display than achieved by previous algorithms, an especially useful characteristic where nodes are labelled with text.en
dc.language.isoen_USen
dc.publisherMIT Artificial Intelligence Laboratoryen
dc.titleReadable Layout of Unbalanced N-ary Treesen
dc.typeWorking Paperen


Files in this item

FilesSizeFormatView
AI_WP_289.pdf440.3Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record