By Topic

Visualization of Clustered Directed Acyclic Graphs without Node Overlapping

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

3 Author(s)
Kumar, P. ; Univ. of Texas at Dallas, Dallas, TX ; Kang Zhang ; Wang, Yuke

Conventional force directed graph drawing methods aim to produce aesthetically pleasing visualization of graphs. The edges of the graph have more or less equal length, and there are as few crossing edges as possible. This paper proposes a new e-spring algorithm for visualizing clustered directed acyclic graphs (DAGs) without node overlapping, extended from the popular spring embedder model. In our framework, nodes are modeled as nonuniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. Experimental results and visualization/analysis of this method are reported.

Published in:

Information Visualisation, 2008. IV '08. 12th International Conference

Date of Conference:

9-11 July 2008