Evaluating force-directed algorithms with a new framework

Maolin Huang*, Weidong Huang, Chun-Cheng Lin

*此作品的通信作者

研究成果: Conference contribution同行評審

5 引文 斯高帕斯(Scopus)

摘要

Force-directed algorithms are widely used in practice for graph drawing. How to evaluate this type of algorithms has been a challenging issue since their performance largely depends on input parameters and thus is not consistent. In this paper, we first review previous approaches used for evaluation of force-directed algorithms. We then present a case study that compares two force-directed algorithms following a newly proposed evaluation framework. This study evaluates the performance of these algorithms in terms of six commonly applied aesthetic criteria and demonstrates how the framework is used. Advantages of this evaluation framework are discussed.

原文English
主出版物標題27th Annual ACM Symposium on Applied Computing, SAC 2012
頁面1030-1032
頁數3
DOIs
出版狀態Published - 2012
事件27th Annual ACM Symposium on Applied Computing, SAC 2012 - Trento, Italy
持續時間: 26 3月 201230 3月 2012

出版系列

名字Proceedings of the ACM Symposium on Applied Computing

Conference

Conference27th Annual ACM Symposium on Applied Computing, SAC 2012
國家/地區Italy
城市Trento
期間26/03/1230/03/12

引用此