Paper Info
Title
PieVis: Interactive Graph Visualization Using a Rings-Based Tree Drawing Algorithm for Children and Crust Display for Parents
Abstract
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.
Year
DOI
Venue
2011
10.1109/IV.2011.68
Information Visualisation
Keywords
Field
DocType
data visualisation,trees (mathematics),PieVis,angular resolution,aspect ratio,circular labeling method,crust display,edge crossings,edgeless rings-based visualization,graph drawing algorithm,interactive graph visualization,node labeling,rings-based tree drawing algorithm,focus+context,graph visualization,interactive,real-time
Graph drawing,Computer science,Tree decomposition,Force-directed graph drawing,Algorithm,Theoretical computer science,Null graph,SPQR tree,Butterfly graph,Lattice graph,Moral graph
Conference
ISSN
ISBN
Citations 
1550-6037
978-1-4577-0868-8
0
PageRank 
References 
Authors
0.34
5
4
Name
Order
Citations
PageRank
Adrian Rusu18210.65
Andrew Crowell200.34
Petzinger, Bryan300.34
Andrew J. Fabian4191.90