Name
Abstract | ||
|---|---|---|
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).Our 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 been found to be the best in all categories. |
Year | Venue | Keywords |
|---|---|---|
2006 | APVIS | real-life molecular combinatory binary,binary tree,avl binary tree,drawing algorithm,separation-based approach,path-based approach,comprehensive experimental study,following distinct tree-drawing approach,ringed circular layout approach,level-based approach,binary trees,planar,straight line |
Field | DocType | ISBN |
Geometry of binary search trees,Scapegoat tree,Combinatorics,Circular layout,Algorithm,Binary tree,Weight-balanced tree,Random binary tree,Ternary search tree,Mathematics,Binary search tree | Conference | 1-920682-41-4 |
Citations | PageRank | References |
1 | 0.35 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adrian Rusu | 1 | 82 | 10.65 |
| Radu Jianu | 2 | 126 | 9.90 |
| Confesor Santiago | 3 | 5 | 1.94 |
| Christopher Clement | 4 | 2 | 1.39 |