Removing Node Overlaps Using Multi-sphere Scheme

Authors:
Takashi Imamichi;Yohei Arahori;Jaeseong Gim;Seok-Hee Hong;Hiroshi Nagamochi
Affiliations:
Department of Applied Mathematics and Physics, Kyoto University,;Department of Applied Mathematics and Physics, Kyoto University,;Department of Applied Mathematics and Physics, Kyoto University,;School of Information Technologies, University of Sydney,;Department of Applied Mathematics and Physics, Kyoto University,
Venue:
Graph Drawing
Year:
2009

Citing 9
Cited 0

On the limited memory BFGS method for large scale optimization

Mathematical Programming: Series A and B
Removing Node Overlapping in Graph Layout Using Constrained Optimization

Constraints
Penetration depth of two convex polytopes in 3D

Nordic Journal of Computing
Improved Force-Directed Layouts

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Visualizing route maps

Visualizing route maps
Using spring algorithms to remove node overlapping

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
A multi-sphere scheme for 2D and 3D packing problems

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Fast node overlap removal

GD'05 Proceedings of the 13th international conference on Graph Drawing
Visualisation and analysis of large and complex scale-free networks

EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of removing overlaps of labels in a given layout by changing locations of some of the overlapping labels, and present a new method for the problem based on a packing approach, called multi-sphere scheme . More specifically, we study two new variations of the label overlap problem, inspired by real world applications, and provide a solution to each problem. Our new approach is very flexible to support various operations such as translation, translation with direction constraints , and rotation . Further, our method can support labels with arbitrary shapes in both 2D and 3D layout settings. Our extensive experimental results show that our new approach is very effective for removing label overlaps.