Force-transfer: a new approach to removing overlapping nodes in graph layout

Authors:
Xiaodi Huang;Wei Lai
Affiliations:
School of Information Technology, Swinburne University of Technology, PO Box 218. Hawthorn, VIC 3126, Australia;School of Information Technology, Swinburne University of Technology, PO Box 218. Hawthorn, VIC 3126, Australia
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 7
Cited 9

Drawing graphs nicely using simulated annealing

ACM Transactions on Graphics (TOG)
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

A framework of filtering, clustering and dynamic layout graphs for visualization

ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Using spring algorithms to remove node overlapping

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Preserving the mental map in interactive graph interfaces

Proceedings of the working conference on Advanced visual interfaces
EnjoyPhoto: a vertical image search engine for enjoying high-quality photos

MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Visual islands: intuitive browsing of visual search results

CIVR '08 Proceedings of the 2008 international conference on Content-based image and video retrieval
Efficient Node Overlap Removal Using a Proximity Stress Model

Graph Drawing
Drawing graphs with nonuniform nodes using potential fields

Journal of Visual Languages and Computing
Wikipedia world map: method and application of map-like wiki visualization

Proceedings of the 7th International Symposium on Wikis and Open Collaboration
Visualizing large-scale human collaboration in Wikipedia

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in each node readable in displaying such graphs, it is required there should be no overlapping nodes. This paper proposes the Force-Transfer algorithm to give a new efficient approach to removing overlapping nodes. The proposed approach employs a heuristic method to approximate the global optimal adjustment with the local minimal movement. Scanning from the seed node, the approach orthogonally transfers the minimum forces to only those nodes recursively overlapping with the node from where the forces start. We compare the Force-Transfer with the Force-Scan algorithm by mathematical proofs and experiments. The Force-Transfer approach can generate better results.