Evaluating force-directed algorithms with a new framework

Huang, M; Huang, W; Lin, CC

Evaluating force-directed algorithms with a new framework

Huang, M

Huang, W

Lin, CC

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the ACM Symposium on Applied Computing, 2012, pp. 1030 - 1032
Issue Date:: 2012-07-12

Closed Access

	Filename	Description	Size
	2012002780OK.pdf		1.45 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Huang, M https://orcid.org/0000-0002-6896-6480	en_US
dc.contributor.author	Huang, W https://orcid.org/0000-0002-5190-7839	en_US
dc.contributor.author	Lin, CC	en_US
dc.date.issued	2012-07-12	en_US
dc.identifier.citation	Proceedings of the ACM Symposium on Applied Computing, 2012, pp. 1030 - 1032	en_US
dc.identifier.isbn	9781450308571	en_US
dc.identifier.uri	http://hdl.handle.net/10453/22926
dc.description.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. © 2012 Authors.	en_US
dc.relation.ispartof	Proceedings of the ACM Symposium on Applied Computing	en_US
dc.relation.isbasedon	10.1145/2245276.2245475	en_US
dc.title	Evaluating force-directed algorithms with a new framework	en_US
dc.type	Conference Proceeding
utslib.for	0806 Information Systems	en_US
dc.location.activity	Riva, Italy	en_US
dc.location.activity	Wuhan China
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Transdisciplinary Innovation
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

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. © 2012 Authors.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/22926