Tidy Tree, Layout, Tree Drawing
Tree Drawings have been used extensively in software engineering and many other business and computer applications. The basic structure of a tree allows for the organization and representation of complex information. Many commercial tools allow their users to draw or construct trees to represent a problem and/or its solution. Our focus is on dynamic trees - trees subject to frequent changes and redisplay in highly user-friendly interactive computer applications. Tree presentations in such interactive tools have to be precise and maintainable, which means, the tree presentations should maintain a particular structure so that user's mental perception of the tree is not disrupted or changed drastically when modifications are made to the tree being manipulated. Minimal modifications to the tree should cause correspondingly minimal changes to the general layout of the tree drawing and such changes should be consistent with the original layout to enable the user to anticipate them and verify their correctness with minimal mental effort. Also, display properties, like Vext, Hext, aspect ratio and space utilization efficiency of the layout are important to the user as they influence efficient use of available drawing/visualizing space which in turn affects comprehensibility of the tree drawing in question. In this thesis report, we analyze and compare three published algorithms, proposed by Workman-Bernard, S. Moen, and R. Cohen ,to interactively manage the layout of graphically represented dynamic trees. We attempt to measure and analyze the performance of these algorithms based on their layout properties and their computational requirements. This research concludes that the Workman-Bernard (WB) algorithm when compared with its closest equivalent, Moen's algorithm, produces trees with better layout at a significantly lower computation cost.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Master of Science (M.S.)
College of Engineering and Computer Science
Length of Campus-only Access
Masters Thesis (Open Access)
Mahajan, Pankaj, "Experimental Analysis And Evaluation Of Tidy Tree Drawing Algorithms" (2006). Electronic Theses and Dissertations. 1130.