Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
An Experimental Study on Algorithms for Drawing Binary Trees
Rusu, A., Jianu, R., Santiago, C. and Clement, C.
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 46367nodes, 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.
Cite as: Rusu, A., Jianu, R., Santiago, C. and Clement, C. (2006). An Experimental Study on Algorithms for Drawing Binary Trees. In Proc. Asia Pacific Symposium on Information Visualisation (APVIS2006), Tokyo, Japan. CRPIT, 60. Misue, K., Sugiyama, K. and Tanaka, J., Eds. ACS. 85-88.
(from crpit.com)
(local if available)
