Evaluating force-directed algorithms with a new framework

Maolin Huang*, Weidong Huang, Chun-Cheng Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


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.

Original languageEnglish
Title of host publication27th Annual ACM Symposium on Applied Computing, SAC 2012
Number of pages3
StatePublished - 2012
Event27th Annual ACM Symposium on Applied Computing, SAC 2012 - Trento, Italy
Duration: 26 Mar 201230 Mar 2012

Publication series

NameProceedings of the ACM Symposium on Applied Computing


Conference27th Annual ACM Symposium on Applied Computing, SAC 2012


  • aesthetic criteria
  • evaluation
  • force-directed algorithms

Cite this