Node Overlap Removal Algorithms: A Comparative Study

Autor:	Chen, Fati, Piccinini, Laurent, Poncelet, Pascal, Sallaberry, Arnaud
Rok vydání:	2019
Předmět:	Computer Science - Computational Geometry 68R10 (Primary) 68U05 (Secondary) I.3.5 H.5.2
Druh dokumentu:	Working Paper
Popis:	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. Comment: Appears in the Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1908.07363 Zobrazit plný text záznamu View this record from Arxiv