Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019
Node Overlap Removal Algorithms: an Extended Comparative Study
Fati Chen, Laurent Piccinini, Pascal Poncelet, and Arnaud Sallaberry
Vol. 24, no. 4, pp. 683-706, 2020. Regular paper.
Abstract In the context of graph layout, 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 their quality has never been provided and it is thus difficult for a visualisation designer to select the algorithm that best suits their needs. In this paper, we review 22 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 9 node overlap removal algorithms. Our experiment involves 854 synthetic and real-world graphs. Finally, we propose a JavaScript library containing both the algorithms and the criteria, and we provide a Web platform, AGORA, in which one can upload graphs, apply the algorithms and compare/download the results.
Submitted: October 2019.
Reviewed: January 2020.
Revised: April 2020.
Accepted: May 2020.
Final: May 2020.
Published: December 2020.
Communicated by Daniel Archambault and Csaba D. Tóth
article (PDF)