Comparing Graph Layouts for Vertex Selection Tasks

R. Klapaukh, David J. Pearce, S. Marshall
{"title":"Comparing Graph Layouts for Vertex Selection Tasks","authors":"R. Klapaukh, David J. Pearce, S. Marshall","doi":"10.1145/2838739.2838740","DOIUrl":null,"url":null,"abstract":"Different graph layouts can affect a user's ability to complete both passive understanding and active interaction tasks. While most research exploring the effects of graph layout looks at a user's ability to accomplish a passive understanding task, this paper's novel contribution is looking at their ability to complete a selection task. Specifically we compare two graph layout algorithms with respect to their suitability for free-form multi-selection. The two layout algorithms are drawn from our previous work which established that they have significantly different understandability metric scores. A motivation for this choice was to explore whether graphs with significantly different metric scores will also have significantly different performance for selection tasks. We carried out our comparison by means of a user experiment that followed a within-subjects design, where 74 users were given a PlayStation Move controller to select vertices in 20 pairs of graphs. We found that while there was no difference in the speed of interaction there was a difference in the number of errors users made between the two layout algorithms.","PeriodicalId":364334,"journal":{"name":"Proceedings of the Annual Meeting of the Australian Special Interest Group for Computer Human Interaction","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Annual Meeting of the Australian Special Interest Group for Computer Human Interaction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2838739.2838740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Different graph layouts can affect a user's ability to complete both passive understanding and active interaction tasks. While most research exploring the effects of graph layout looks at a user's ability to accomplish a passive understanding task, this paper's novel contribution is looking at their ability to complete a selection task. Specifically we compare two graph layout algorithms with respect to their suitability for free-form multi-selection. The two layout algorithms are drawn from our previous work which established that they have significantly different understandability metric scores. A motivation for this choice was to explore whether graphs with significantly different metric scores will also have significantly different performance for selection tasks. We carried out our comparison by means of a user experiment that followed a within-subjects design, where 74 users were given a PlayStation Move controller to select vertices in 20 pairs of graphs. We found that while there was no difference in the speed of interaction there was a difference in the number of errors users made between the two layout algorithms.
比较顶点选择任务的图形布局
不同的图形布局会影响用户完成被动理解和主动交互任务的能力。虽然大多数探索图形布局影响的研究着眼于用户完成被动理解任务的能力,但这篇论文的新颖贡献是着眼于他们完成选择任务的能力。具体来说,我们比较了两种图形布局算法对自由形式多选择的适用性。这两种布局算法是从我们以前的工作中得出的,这些工作确定了它们具有显着不同的可理解性度量分数。这种选择的动机是探索具有显著不同度量分数的图是否也会在选择任务中具有显著不同的性能。我们通过遵循主题内设计的用户实验进行了比较,其中74名用户获得PlayStation Move控制器,以在20对图中选择顶点。我们发现,虽然交互速度没有差异,但用户在两种布局算法之间犯的错误数量有所不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信