Node Overlap Removal Algorithms: A Comparative Study
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.
KeywordsGraph drawing Layout adjustment Node overlap removal
This research has been partly funded by a national French grant (ANR Daphne 17-CE28-0013-01).
- 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
- 4.Erdös, P., Rényi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290–291 (1959)Google Scholar
- 9.Hu, Y.: Efficient, high-quality force-directed graph drawing. Math. J. 10(1), 37–71 (2005)Google Scholar
- 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
- 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