Geodesic
Node Overlap Removal Algorithms: an Extended Comparative Study
Journal of Graph Algorithms and Applications, Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019 , Tome 24 (2020) no. 4, pp. 683-706.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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.
DOI : 10.7155/jgaa.00532
Keywords: graph drawing, node overlap removal, layout adjustment, comparative study 
@article{JGAA_2020_24_4_a6,
     author = {Fati Chen and Laurent Piccinini and Pascal Poncelet and Arnaud Sallaberry},
     title = {Node {Overlap} {Removal} {Algorithms:} an {Extended} {Comparative} {Study}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {683--706},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2020},
     doi = {10.7155/jgaa.00532},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00532/}
}
TY  - JOUR
AU  - Fati Chen
AU  - Laurent Piccinini
AU  - Pascal Poncelet
AU  - Arnaud Sallaberry
TI  - Node Overlap Removal Algorithms: an Extended Comparative Study
JO  - Journal of Graph Algorithms and Applications
PY  - 2020
SP  - 683
EP  - 706
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00532/
DO  - 10.7155/jgaa.00532
LA  - en
ID  - JGAA_2020_24_4_a6
ER  - 
%0 Journal Article
%A Fati Chen
%A Laurent Piccinini
%A Pascal Poncelet
%A Arnaud Sallaberry
%T Node Overlap Removal Algorithms: an Extended Comparative Study
%J Journal of Graph Algorithms and Applications
%D 2020
%P 683-706
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00532/
%R 10.7155/jgaa.00532
%G en
%F JGAA_2020_24_4_a6
Fati Chen; Laurent Piccinini; Pascal Poncelet; Arnaud Sallaberry. Node Overlap Removal Algorithms: an Extended Comparative Study. Journal of Graph Algorithms and Applications, 
							Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019
					, Tome 24 (2020) no. 4, pp. 683-706. doi : 10.7155/jgaa.00532. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00532/

Cité par Sources :