Removing Node Overlaps Using Multi-sphere Scheme

  • Takashi Imamichi
  • Yohei Arahori
  • Jaeseong Gim
  • Seok-Hee Hong
  • Hiroshi Nagamochi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)


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.


Remove Node Layout Algorithm Graph Layout Direction Constraint Extensive Experimental Result 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Agarwal, P.K., Guibas, L.J., Har-Peled, S., Rabinovitch, A., Sharir, M.: Penetration depth of two convex polytopes in 3D. Nordic Journal of Computing 7(3), 227–240 (2000)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Agrawala, M.: Visualizing Route Maps. Ph.D. thesis, Stanford University (2002)Google Scholar
  3. 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
  4. 4.
    Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153–164. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 364–373. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 6.
    Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order. Systems and Computers in Japan 33(2), 31–42 (2002)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Imamichi, T., Nagamochi, H.: A multi-sphere scheme for 2D and 3D packing problems. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 207–211. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 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
  10. 10.
    Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Mathematical Programming 45(3), 503–528 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Lyons, K.A., Meijer, H., Rappaport, D.: Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications 2(1), 1–24 (1998)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Marriott, K., Stuckey, P., Tam, V., He, W.: Removing node overlapping in graph layout using constrained optimization. Constraints 8(2), 143–171 (2003)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Takashi Imamichi
    • 1
  • Yohei Arahori
    • 1
  • Jaeseong Gim
    • 1
  • Seok-Hee Hong
    • 2
  • Hiroshi Nagamochi
    • 1
  1. 1.Department of Applied Mathematics and PhysicsKyoto UniversityJapan
  2. 2.School of Information TechnologiesUniversity of SydneyAustralia

Personalised recommendations