Skip to Main content Skip to Navigation
Journal articles

Node Overlap Removal Algorithms: an Extended Comparative Study

Fati Chen 1, 2 Laurent Piccinini 1 Pascal Poncelet 2 Arnaud Sallaberry 2, 1 
2 ADVANSE - ADVanced Analytics for data SciencE
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In the context of graph layout, many algorithms have been designed to remove node overlapping, and many quality criteria and associated met-rics 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Fati CHEN Connect in order to contact the contributor
Submitted on : Wednesday, June 24, 2020 - 10:29:50 AM
Last modification on : Friday, August 5, 2022 - 3:02:49 PM


Files produced by the author(s)



Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. Node Overlap Removal Algorithms: an Extended Comparative Study. Journal of Graph Algorithms and Applications, Brown University, In press, ⟨10.7155/jgaa.00532⟩. ⟨lirmm-02879677⟩



Record views


Files downloads