CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
An algorithm for drawing general undirected graphs
Information Processing Letters
Drawing graphs: methods and models
Drawing graphs: methods and models
Proceedings of the eighteenth annual symposium on Computational geometry
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Spring Algorithms and Symmetry
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Validating Graph Drawing Aesthetics
GD '95 Proceedings of the Symposium on Graph Drawing
Layout Adjustment and Boundary Detection for a Diagram
CGI '01 Computer Graphics International 2001
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
Bayesian Artificial Intelligence
Bayesian Artificial Intelligence
Using spring algorithms to remove node overlapping
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Applying Graphical Design Techniques to Graph Visualisation
IV '05 Proceedings of the Ninth International Conference on Information Visualisation
Navigating Software Architectures with Constant Visual Complexity
VLHCC '05 Proceedings of the 2005 IEEE Symposium on Visual Languages and Human-Centric Computing
A new algorithm for removing node overlapping in graph visualization
Information Sciences: an International Journal
Journal of Visual Languages and Computing
Social Network Analysis of Online Marketplaces
ICEBE '07 Proceedings of the IEEE International Conference on e-Business Engineering
Visualization of Clustered Directed Acyclic Graphs without Node Overlapping
IV '08 Proceedings of the 2008 12th International Conference Information Visualisation
Node overlap removal in clustered directed acyclic graphs
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
Graph drawing and visualization represent structural information as diagrams 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 reductions in the range of 45% to 79%.