Node Overlap Removal Algorithms: A Comparative Study - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Node Overlap Removal Algorithms: A Comparative Study

Résumé

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.
Fichier principal
Vignette du fichier
1908.07363.pdf (2 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02302617 , version 1 (02-10-2019)

Identifiants

Citer

Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. Node Overlap Removal Algorithms: A Comparative Study. GD 2019 - 27th International Symposium on Graph Drawing and Network Visualization, Daniel Archambault; Csaba D. Tóth, Sep 2019, Prague, Czech Republic. pp.179-192, ⟨10.1007/978-3-030-35802-0_14⟩. ⟨hal-02302617⟩
155 Consultations
178 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More