Readable Layout of Unbalanced N-ary Trees
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 o...
| Main Author: | |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
MIT Artificial Intelligence Laboratory
2008
|
| Online Access: | http://hdl.handle.net/1721.1/41166 |
| _version_ | 1811075883684855808 |
|---|---|
| author | Solo, David M. |
| author_facet | Solo, David M. |
| author_sort | Solo, David M. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T10:13:18Z |
| format | Working Paper |
| id | mit-1721.1/41166 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T10:13:18Z |
| publishDate | 2008 |
| publisher | MIT Artificial Intelligence Laboratory |
| record_format | dspace |
| spelling | mit-1721.1/411662019-04-12T09:44:53Z Readable Layout of Unbalanced N-ary Trees Solo, David M. 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. MIT Artificial Intelligence Laboratory 2008-04-14T14:58:00Z 2008-04-14T14:58:00Z 1986-08 Working Paper http://hdl.handle.net/1721.1/41166 en_US MIT Artificial Intelligence Laboratory Working Papers, WP-289 application/pdf MIT Artificial Intelligence Laboratory |
| spellingShingle | Solo, David M. Readable Layout of Unbalanced N-ary Trees |
| title | Readable Layout of Unbalanced N-ary Trees |
| title_full | Readable Layout of Unbalanced N-ary Trees |
| title_fullStr | Readable Layout of Unbalanced N-ary Trees |
| title_full_unstemmed | Readable Layout of Unbalanced N-ary Trees |
| title_short | Readable Layout of Unbalanced N-ary Trees |
| title_sort | readable layout of unbalanced n ary trees |
| url | http://hdl.handle.net/1721.1/41166 |
| work_keys_str_mv | AT solodavidm readablelayoutofunbalancednarytrees |