Grid Drawings of Binary Trees: An Experimental Study
نویسندگان
چکیده
In this paper we consider the class of binary trees and present the results of a comprehensive experimental study on the four most representative algorithms for drawing trees, one for each of the following treedrawing approaches: Separation-Based, Path-based, Level-based, and Ringed Circular Layout. We establish a simpler, more intuitive format for storing binary trees in files and create a large suite of randomlygenerated, unbalanced, complete, AVL, Fibonacci, and molecular combinatory binary trees of various sizes. Our study is therefore conducted on randomly-generated, unbalanced, and AVL binary trees with between 100 and 50, 000 nodes, on Fibonacci trees Tn for n = 1, 2, ..., 45, 46 (143 to 46, 367 nodes), on complete binary trees of size 2−1 for n = 7, 8, ..., 15, 16 (127 to 65, 535 nodes), and on molecular combinatory binary trees with between 133 and 50, 005 nodes. Our study yields 70 charts comparing the performance of the drawing algorithms with respect to ten quality measures, namely Area, Aspect Ratio, Size, Total Edge Length, Average Edge Length, Maximum Edge Length, Uniform Edge Length, Angular Resolution, Closest Leaf, and Farthest Leaf. None of the algorithms has been found to be the best in all categories. This observation leads us to create an adaptive 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 adaptive tree drawing system recognizes all six types of binary trees and all ten measures included in our experimental study. Under our settings, our adaptive tree drawing system outperforms any system using a single binary tree drawing algorithm. Submitted: April 2007 Reviewed: June 2007 Revised: August 2007 Accepted: October 2007 Final: November 2007 Published: June 2008 Article type: Regular Paper Communicated by: S. Kobourov E-mail addresses: [email protected] (Adrian Rusu) [email protected] (Confesor Santiago) 132 Rusu & Santiago Grid Drawings of Binary Trees
منابع مشابه
Area-eecient Algorithms for Upward Straight-line Tree Drawings ?
In this paper, we investigate planar upward straight-line grid drawing problems for bounded-degree rooted trees so that a drawing takes up as little area as possible. A planar upward straight-line grid tree drawing satisses the following four constraints: (1) all vertices are placed at distinct grid points (grid), (2) all edges are drawn as straight lines (straight-line), (3) no two edges in th...
متن کاملArea-efficient Grid Drawings of Graphs
The visualization of relational information is concerned with the presentation of abstract information about relationships between various entities. It has many applications in diverse domains such as software engineering, biology, civil engineering, and cartography. Relational information is typically modeled by an abstract graph, where vertices are entities and edges represent relationships b...
متن کاملUpward Tree Drawings with Optimal
Rooted trees are usually drawn planar and upward, i.e., without crossings and without any parent placed below its child. In this paper we investigate the area requirement of planar upward drawings of rooted trees. We give tight upper and lower bounds on the area of various types of drawings, and provide linear-time algorithms for constructing optimal area drawings. Let T be a bounded-degree roo...
متن کاملA Note on Optimal Area Algorithms for Upward Drawings of Binary Trees
Crescenzi, P., G. Di Battista and A. Piperno, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry: Theory and Applications 2 (1992) 187-200. The goal of this paper is to investigate the area requirements for upward grid drawings of binary trees. First, we show that there is a family of binary trees with n vertices that require Q(n logn) area; this bound...
متن کاملPlanar upward tree drawings with optimal area
Rooted trees are usually drawn planar and upward i e without crossings and with out any parent placed below its child In this paper we investigate the area requirement of planar upward drawings of rooted trees We give tight upper and lower bounds on the area of various types of drawings and provide linear time algorithms for constructing optimal area drawings Let T be a bounded degree rooted tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 12 شماره
صفحات -
تاریخ انتشار 2008