Evaluating force-directed algorithms with a new framework

Authors:
Maolin Huang;Weidong Huang;Chun-Cheng Lin
Affiliations:
University of Technology, Sydney, Australia;CSIRO ICT Centre, Australia;National Chiao Tung University, Taiwan
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 5
Cited 0

Graph drawing by force-directed placement

Software—Practice & Experience
Drawing on physical analogies

Drawing graphs
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms

GD '95 Proceedings of the Symposium on Graph Drawing
Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics

VLHCC '10 Proceedings of the 2010 IEEE Symposium on Visual Languages and Human-Centric Computing
Topology-driven force-directed algorithms

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.