Visualization of Clustered Directed Acyclic Graphs without Node Overlapping
Kumar, P.; Kang Zhang; Yuke Wang
Information Visualisation, 2008. IV apos;08. 12th International Conference
Volume , Issue , 9-11 July 2008 Page(s):38 - 43
Digital Object Identifier   10.1109/IV.2008.85
Summary: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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.