Node Overlap Removal Algorithms: an Extended Comparative Study - Archive ouverte HAL Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2020

Node Overlap Removal Algorithms: an Extended Comparative Study

(1, 2) , (1) , (2) , (2, 1)
1
2

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.
Fichier principal
Vignette du fichier
532.pdf (3.21 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-02879677 , version 1 (24-06-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More