A new algorithm for removing node overlapping in graph visualization

Authors:
Xiaodi Huang;Wei Lai;A. S. M. Sajeev;Junbin Gao
Affiliations:
Department of Mathematics, Statistics and Computer Science, The University of New England, Australia;School of Information Technology, Swinburne University of Technology, Australia;Department of Mathematics, Statistics and Computer Science, The University of New England, Australia;School of Information Technology, Charles Sturt University, Australia
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 14
Cited 6

Drawing graphs nicely using simulated annealing

ACM Transactions on Graphics (TOG)
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Genetic Algorithms

Genetic Algorithms
Removing edge-node intersections in drawings of graphs

Information Processing Letters
Constrained Graph Layout

Constraints
Removing Node Overlapping in Graph Layout Using Constrained Optimization

Constraints
Graph Layout Adjustment Strategies

GD '95 Proceedings of the Symposium on Graph Drawing
Two-dimensional packing algorithms for layout of disconnected graphs

Information Sciences—Informatics and Computer Science: An International Journal
On labeling in graph visualization

Information Sciences: an International Journal
Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution

Information Sciences: an International Journal
Drawing graphs with non-uniform vertices

Proceedings of the Working Conference on Advanced Visual Interfaces
A layout algorithm for signaling pathways

Information Sciences: an International Journal
Clustering graphs for visualization via node similarities

Journal of Visual Languages and Computing

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
Designing plant layouts with toxic releases based on wind statistics

MS '08 Proceedings of the 19th IASTED International Conference on Modelling and Simulation
Multi-con: exploring graphs by fast switching among multiple contexts

Proceedings of the International Conference on Advanced Visual Interfaces
Mental map preserving graph drawing using simulated annealing

Information Sciences: an International Journal
Rolled-out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives

Computer Graphics Forum

Quantified Score

Hi-index	0.07

Visualization

Abstract

Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, particularly in dynamic graph visualization. Providing a formal description of this problem, this paper presents a new approach called the Force-Transfer algorithm that removes node overlaps. Compared to other methods, our algorithm is usually able to achieve a compact adjusted layout within a reasonable running time.