Visualization of clustered directed acyclic graphs with node interleaving
Proceedings of the 2009 ACM symposium on Applied Computing
Node overlap removal in clustered directed acyclic graphs
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
Conventional force directed graph drawing methods aimto 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. Thispaper proposes a new E-Spring algorithm for visualizingclustered directed acyclic graphs (DAGs) without nodeoverlapping, extended from the popular spring embeddermodel. In our framework, nodes are modeled as nonuniformcharged particles with weights, and a finaldrawing is derived by adjusting the positions of thenodes according to a combination of spring forces andrepulsive forces derived from electrostatic forcesbetween the nodes. Experimental results andvisualization/analysis of this method are reported.