节点重叠消除算法的比较研究
Node Overlap Removal Algorithms: A Comparative Study
摘要：
已经设计了许多算法来消除节点重叠，并且已经提出了许多质量标准和相关度量来评估这些算法。不幸的是，一个完整的比较的算法的基础上的一些指标，评估的质量从来没有提供，因此很难为可视化设计师选择最适合他的需要的算法。在本文中，我们回顾了文献中的21个指标，根据它们试图捕获的质量标准对它们进行分类，并为每个类别选择一个具有代表性的指标。基于所选择的度量，我们比较了8个节点重叠消除算法。我们的实验涉及854个合成和真实世界的图。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
