Removing Node Overlaps Using Multi-sphere Scheme
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.
KeywordsRemove Node Layout Algorithm Graph Layout Direction Constraint Extensive Experimental Result
- 2.Agrawala, M.: Visualizing Route Maps. Ph.D. thesis, Stanford University (2002)Google Scholar
- 3.Ahmed, A., Dwyer, T., Hong, S.H., Murray, C., Song, L., Wu, Y.X.: Visualisation and analysis of large and complex scale-free networks. In: EUROVIS 2005: Eurographics / IEEE VGTC Symposium on Visualization, pp. 239–246 (2005)Google Scholar
- 7.Imamichi, T., Arahori, Y., Gim, J., Hong, S.H., Nagamochi, H.: Removing overlaps in label layouts using multi-sphere scheme. Tech. Rep. 2008-006, Dept. of Applied Mathematics and Physics, Kyoto University (2008)Google Scholar
- 9.Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: APVis 2005. CRPIT, vol. 45, pp. 131–140 (2005)Google Scholar