Adaptive Binary Trees Visualization with Respect to User-Specified Quality Measures

Many algorithms have been designed to visualize binary trees efficiently with respect to a quality measure. While each algorithm is suitable for drawing particular categories of binary trees, an effort to compile these algorithms to maximize the quality of drawings has not been realized. Our first step is to create a system that determines the type of a binary tree and then selects an algorithm to draw the tree depending upon the specified quality measures. Currently, our system recognizes six types of binary trees (AVL, complete, Fibonacci, random, unbalanced-to-the-left, unbalanced-to-the-right) and allows the user to choose from eleven quality measures (area, aspect ratio, total edge length, maximum edge length, uniform edge length, closest leaf, farthest leaf, size, minimum angle size, average angle size, angular resolution). Experiments show that our adaptive visualization system outperforms any system using a single binary tree drawing algorithm. In addition, our approach allows the user to select multiple quality measures and automatically detects the best available binary tree drawing algorithm