Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space
نویسندگان
چکیده
We present a new visualization technique, called (Reconfigurable Disc Tree) which can alleviate the disadvantages of cone trees significantly for large hierarchies while maintaining its context of using 3D depth. In , each node is associated with a disc around which its children are placed. Using discs instead of cones as the basic shape in has several advantages: significant reduction of occluded region, sharp increase in number of displayed nodes, and easy projection onto plane without visual overlapping. We show that can greatly enhance user perception by transforming its shapes dynamically in several ways: (1) disc tree which can significantly reduce the occluded region by the foreground objects, (2) compact disc tree which can increase the number of nodes displayed on the screen, and (3) plane disc tree which can be mapped onto the plane without visual overlapping. We describe an implementation of our visualization system called VISIT (Visual Information System for reconfigurable dIsc Tree). It provides 2D and 3D layouts for and various user interface features such as tree reconfiguration, tree transformation, tree shading, viewing transformation, animation, selection and browsing which can enhance the user perception and navigation capabilities. We also evaluate our system using the following three metrics: percentage of occlusion, density of displayed nodes on a screen. number of identifiable nodes.
منابع مشابه
Three-Dimensional Feature Diagrams Visualization
Visualizing and manipulating large feature diagrams is still an open issue for the SPL community. Few effort has been made on improving the techniques to get the most out of drawing space and current feature modeling tools either use file-system-like trees or 2D graphs that must be scrolled to locate features. The aim of this paper is presenting a new method to draw large feature models based o...
متن کاملRadial Clustergrams: Visualizing the Aggregate Properties of Hierarchical Clusters
A new radial space-filling method for visualizing cluster hierarchies is presented. The method, referred to as a radial clustergram, arranges the clusters into a series of layers, each representing a different level of the tree. It uses adjacency of nodes instead of links to represent parent-child relationships and allocates sufficient screen real estate to each node to allow effective visualiz...
متن کاملImproved Navigation for TreeRing
Hierarchical structures, such as organization charts, file directories, and catalogs, are widely used in our society. Many techniques have been developed for visualizing such structures. These include the traditional node-link diagram, Treemap and its variations, hyperbolic browser, cone tree and so on. A detailed review of visualization techniques for hierarchical structures will be presented ...
متن کاملSymmetry and Node Focused Visualization of Large Trees
In this paper, we take a different approach to visualizing very large trees. To facilitate presentation and exploration of massive hierarchical datasets such as linguistic and genealogical hierarchies, our approach considers drawing layouts of tree-cuts as a function of a node-of-interest or NOI, and uses interaction to support rapid access to the entire tree. Instead of emphasizing overall tre...
متن کاملRELT - Visualizing Trees on Mobile Devices
The small screens on increasingly used mobile devices challenge the traditional visualization methods designed for desktops. This paper presents a method called “Radial Edgeless Tree” (RELT) for visualizing trees in a 2-dimensional space. It combines the existing connection tree drawing with the space-filling approach to achieve the efficient display of trees in a small geometrical area, such a...
متن کامل