Advertisement

Node Overlap Removal Algorithms: A Comparative Study

  • Fati ChenEmail author
  • Laurent Piccinini
  • Pascal Poncelet
  • Arnaud Sallaberry
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11904)

Abstract

Many algorithms have been designed to remove node overlapping, and many quality criteria and associated metrics have been proposed to evaluate those algorithms. Unfortunately, a complete comparison of the algorithms based on some metrics that evaluate the quality has never been provided and it is thus difficult for a visualization designer to select the algorithm that best suits his needs. In this paper, we review 21 metrics available in the literature, classify them according to the quality criteria they try to capture, and select a representative one for each class. Based on the selected metrics, we compare 8 node overlap removal algorithms. Our experiment involves 854 synthetic and real-world graphs.

Keywords

Graph drawing Layout adjustment Node overlap removal 

Notes

Acknowledgement

This research has been partly funded by a national French grant (ANR Daphne 17-CE28-0013-01).

References

  1. 1.
    Barabaśi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Chimani, M., Gutwenger, C., Jünger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 543–569. Chapman and Hall/CRC, London (2013)Google Scholar
  3. 3.
    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).  https://doi.org/10.1007/11618058_15CrossRefGoogle Scholar
  4. 4.
    Erdös, P., Rényi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290–291 (1959)Google Scholar
  5. 5.
    Gansner, E., Hu, Y.: Efficient, proximity-preserving node overlap removal. J. Graph Algorithms Appl. 14(1), 53–74 (2010)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gansner, E.R., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exp. 30(11), 1203–1233 (2000)CrossRefGoogle Scholar
  7. 7.
    Hachul, S., Jünger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285–295. Springer, Heidelberg (2005).  https://doi.org/10.1007/978-3-540-31843-9_29CrossRefzbMATHGoogle Scholar
  8. 8.
    Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 183–197. Springer, Heidelberg (1998).  https://doi.org/10.1007/3-540-37623-2_14CrossRefGoogle Scholar
  9. 9.
    Hu, Y.: Efficient, high-quality force-directed graph drawing. Math. J. 10(1), 37–71 (2005)Google Scholar
  10. 10.
    Huang, X., Lai, W.: Force-transfer: a new approach to removing overlapping nodes in graph layout. In: Proceedings of the 26th Australasian computer science conference, vol. 16, pp. 349–358. Australian Computer Society, Inc. (2003)Google Scholar
  11. 11.
    Huang, X., Lai, W., Sajeev, A., Gao, J.: A new algorithm for removing node overlapping in graph visualization. Inf. Sci. 177(14), 2821–2844 (2007)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proceedings of the 2005 Asia-Pacific Symposium on Information Visualisation, vol. 45, pp. 131–140. APVis 2005. Australian Computer Society Inc, Darlinghurst (2005)Google Scholar
  13. 13.
    Lyons, K.A., Meijer, H., Rappaport, D.: Algorithms for cluster busting in anchored graph drawing. J. Graph Algorithms Appl. 2(1), 1–24 (1998)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Marriott, K., Stuckey, P., Tam, V., He, W.: Removing node overlapping in graph layout using constrained optimization. Constraints 8(2), 143–171 (2003)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183–210 (1995)CrossRefGoogle Scholar
  16. 16.
    Nachmanson, L., Nocaj, A., Bereg, S., Zhang, L., Holroyd, A.: Node overlap removal by growing a tree. In: Hu, Y., Nöllenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 33–43. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-50106-2_3CrossRefGoogle Scholar
  17. 17.
    Strobelt, H., Spicker, M., Stoffel, A., Keim, D., Deussen, O.: Rolled-out wordles: a heuristic method for overlap removal of 2D data representatives. Comput. Graph. Forum 31(3), 1135–1144 (2012)CrossRefGoogle Scholar
  18. 18.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.LIRMM - CNRS - Université de MontpellierMontpellierFrance
  2. 2.Université Paul-Valéry Montpellier 3MontpellierFrance

Personalised recommendations