Skip to Main content Skip to Navigation
Directions of work or proceedings

Node Overlap Removal Algorithms: A Comparative Study

Fati Chen 1, 2 Laurent Piccinini 1 Pascal Poncelet 2 Arnaud Sallaberry 2
2 ADVANSE - ADVanced Analytics for data SciencE
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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.
Document type :
Directions of work or proceedings
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Fati Chen <>
Submitted on : Wednesday, October 2, 2019 - 9:26:19 AM
Last modification on : Monday, November 30, 2020 - 9:52:14 AM


Files produced by the author(s)




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



Record views


Files downloads