Readable Layout of Unbalanced N-ary Trees
Name
AI_WP_289.pdf
Description
Main article
Size
430.07 KB
Format
Adobe PDF
Checksum (MD5)
ddcbd2c70cdf6b1980c0478751b0f2d2
Author(s)
Solo, David M.
Date Issued
August 1986
Publisher
MIT Artificial Intelligence Laboratory
Series/Report no.
MIT Artificial Intelligence Laboratory Working Papers, WP-289
Abstract
The 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.
Persistent DSpace Link
