In this paper we present the results of a comprehensive experimental study on the four most representative algorithms for drawing binary trees without distorting or occluding the information, one for each of the following distinct tree-drawing approaches: Separation-Based approach (Garg & Rusu 2003), Path-Based approach (Chan, Goodrich, Rao Kosaraju & Tamassia 2002), Level-Based approach (Reingold & Tilford 1981), and Ringed Circular Layout approach (Teoh & Ma 2002).
rnOur study is conducted on randomly-generated, unbalanced, and AVL binary trees with up to 50,000 nodes, on Fibonacci trees with up to 46, 367 nodes, on complete trees with up to 65, 535 nodes, and on real-life molecular combinatory binary trees with up to 50,005 nodes. We compare the performance of the drawing algorithms with respect to five quality measures, namely Area, Aspect Ratio, Uniform Edge Length, Angular Resolution, and Farthest Leaf. None of the algorithms have beenfound to be the best in all categories.
在本文中,我们对四种最有代表性的用于绘制二叉树而又不失真或不遮挡信息的算法进行了全面的实验研究,以下每种 distinct I>树绘制方法均采用一种算法:基于分离的方法 B>(Garg&Rusu 2003),基于路径的方法 B>(Chan,Goodrich,Rao Kosaraju&Tamassia 2002),基于级别的方法< / B>(Reingold和Tilford 1981),和环形圆形布局方法 B>(Teoh&Ma 2002)。 P> rn
我们的研究是针对随机生成的,不平衡的和AVL具有多达50,000个节点的二叉树,位于具有多达46、367个节点的斐波那契树,具有多达65、535个节点的完整树以及具有多达50,005个节点的现实分子组合二叉树上。我们相对于五个质量度量,即面积,纵横比,均匀边缘长度,角度分辨率 B>和最远的叶子 B>,比较了绘制算法的性能。被发现是所有类别中最好的。 P>
Rowan University, Glassboro, NJ;
Brown University, Providence, RI;
机译:二叉树的网格图:实验研究
机译:在平面上绘制二叉树的算法
机译:具有线性面积和任意长宽比的直线保留二叉树绘制算法
机译:二叉树绘制算法的实验研究
机译:二进制搜索树的并发算法。
机译:遗传算法和二叉树预测医疗人员的计算机视觉综合症
机译:关于优化二叉树h-v图的并行算法的说明
机译:二叉树的扩张映射的有效算法