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: | Solo, David M. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
MIT Artificial Intelligence Laboratory
2008
|
Online Access: | http://hdl.handle.net/1721.1/41166 |
Similar Items
-
Percolation Problems on <i>N</i>-Ary Trees
by: Tianxiang Ren, et al.
Published: (2023-06-01) -
On n-ary ring congruences of n-ary semirings
by: Pakorn Palakawong na Ayutthaya, et al.
Published: (2022-08-01) -
The 2N-ary choice tree model for N-alternative preferential choice
by: Lena Maria Wollschläger, et al.
Published: (2012-06-01) -
Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree
by: Tran Minh Bao, et al.
Published: (2016-03-01) -
Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree
by: Tran Minh Bao, et al.
Published: (2016-02-01)