Aesthetic layout of generalized trees
Aesthetic layout of generalized trees
复制标题
广义树木的美学布局
DOI：
10.1002/spe.4380230802
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
A. Bloesch
中科院分区：
文献类型：
--
作者：
A. Bloesch
对树的美学布局的研究主要关注具有小的恒定大小节点的二叉树的特殊情况。然而，在不需要一般图形布局算法的情况下，许多布局问题涉及具有可变大小节点的n叉树。本文讨论了这类树木的美学布局的一般问题。两个算法的广义树的布局，并讨论了一般问题，如适当的美学。所描述的算法适用于类层次结构的布局、目录树和tableau风格的证明等任务。
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.