Sciweavers

Share
SAC
2009
ACM

Visualization of clustered directed acyclic graphs with node interleaving

9 years 2 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring algorithm, extended from the popular spring embedder model, eliminates node overlaps in clustered DAGs by modeling nodes as charged particles whose repulsion is controlled by edges modeled as springs. The drawing process needs to reach a stable state when the average distances of separation between nodes are near optimal. This paper presents an enhancement to E-Spring to introduce a stopping condition, which reduces equilibrium distances between nodes and therefore results in a significantly reduced area for DAG visualization. It imposes an upper bound on the repulsive forces between nodes based on graph geometry. The algorithm employs node interleaving to eliminate any residual node overlaps. These new techniques have been validated by visualizing eBay buyer-seller relationships and resulted in overall area red...
Pushpa Kumar, Kang Zhang
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where SAC
Authors Pushpa Kumar, Kang Zhang
Comments (0)
books