By Topic

PieVis: Interactive Graph Visualization Using a Rings-Based Tree Drawing Algorithm for Children and Crust Display for Parents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rusu, A. ; Dept. of Comput. Sci., Rowan Univ., Glassboro, CA, USA ; Crowell, A. ; Petzinger, Bryan ; Fabian, A.

The quality of a graph drawing algorithm is often measured by its edge crossings, angular resolution, aspect ratio, and node labeling. Algorithms for drawing trees in general are segregated from algorithms for drawing graphs. In this paper we present a graph visualization system that uses a novel interconnection between a tree drawing algorithm and graph drawing techniques. First, the graph is transformed into a tree and nodes that have multiple parent connections within the graph are duplicated within the tree. While some of the connection information is lost during this transformation, the multiple connections can be regained by interactively displaying the details based on the degree of interest. We use an edgeless rings-based visualization which allows edge crossings and angular resolution issues to be eliminated and has a desirable aspect ratio of 1. Finally, a circular labeling method is used that provides user-friendly labels that do not overlap and clearly show node affiliation.

Published in:

Information Visualisation (IV), 2011 15th International Conference on

Date of Conference:

13-15 July 2011