Premium
Aesthetic layout of generalized trees
Author(s) -
Bloesch Anthony
Publication year - 1993
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380230802
Subject(s) - computer science , mathematical proof , class (philosophy) , graph layout , binary tree , theoretical computer science , graph , directory , page layout , weight balanced tree , binary search tree , mathematics , algorithm , graph drawing , artificial intelligence , art , geometry , operating system , visual arts
Research on the aesthetic layout of trees has been largely concerned with the special case of binary trees with small constant‐sized nodes. Yet, without otherwise requiring the power of general graph‐layout algorithms, many layout problems involve n ‐ary trees with variable‐sized nodes. This paper addresses the general issue of the aesthetic layout of such trees. Two algorithms are presented for the layout of generalized trees, and general issues, such as appropriate aesthetics, are discussed. The algorithms described are suitable for such tasks as the layout of class hierarchies, directory trees and tableau‐style proofs.