An evaluation of content browsing techniques for hierarchical space-filling visualizations

K. Shi, Pourang Irani, P. Li
{"title":"An evaluation of content browsing techniques for hierarchical space-filling visualizations","authors":"K. Shi, Pourang Irani, P. Li","doi":"10.1109/INFVIS.2005.1532132","DOIUrl":null,"url":null,"abstract":"Space-filling visualizations, such as the TreeMap, are well suited for displaying the properties of nodes in hierarchies. To browse the contents of the hierarchy, the primary mode of interaction is by drilling down through many successive layers. In this paper we introduce a distortion algorithm based on fisheye and continuous zooming techniques for browsing data in the TreeMap representation. The motivation behind the distortion approach is for assisting users to rapidly browse information displayed in the TreeMap without opening successive layers of the hierarchy. Two experiments were conducted to evaluate the new approach. In the first experiment (N=20) the distortion approach is compared to the drill down method. Results show that subjects are quicker and more accurate in locating targets of interest using the distortion method. The second experiment (N=12) evaluates the effectiveness of the two approaches in a task requiring context, we define as the context browsing task. The results show that subjects are quicker and more accurate in locating targets with the distortion technique in the context browsing task.","PeriodicalId":123643,"journal":{"name":"IEEE Symposium on Information Visualization, 2005. INFOVIS 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Symposium on Information Visualization, 2005. INFOVIS 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFVIS.2005.1532132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42

Abstract

Space-filling visualizations, such as the TreeMap, are well suited for displaying the properties of nodes in hierarchies. To browse the contents of the hierarchy, the primary mode of interaction is by drilling down through many successive layers. In this paper we introduce a distortion algorithm based on fisheye and continuous zooming techniques for browsing data in the TreeMap representation. The motivation behind the distortion approach is for assisting users to rapidly browse information displayed in the TreeMap without opening successive layers of the hierarchy. Two experiments were conducted to evaluate the new approach. In the first experiment (N=20) the distortion approach is compared to the drill down method. Results show that subjects are quicker and more accurate in locating targets of interest using the distortion method. The second experiment (N=12) evaluates the effectiveness of the two approaches in a task requiring context, we define as the context browsing task. The results show that subjects are quicker and more accurate in locating targets with the distortion technique in the context browsing task.
分级空间填充可视化的内容浏览技术评价
空间填充可视化,如TreeMap,非常适合显示层次结构中节点的属性。要浏览层次结构的内容,主要的交互模式是通过向下钻取许多连续的层。本文介绍了一种基于鱼眼的失真算法和连续缩放技术,用于在树状地图表示中浏览数据。扭曲方法背后的动机是帮助用户快速浏览显示在TreeMap中的信息,而无需打开层次结构的连续层。进行了两个实验来评估新方法。在第一个实验中(N=20),将失真方法与钻入方法进行比较。实验结果表明,实验对象在定位感兴趣目标时能够更快、更准确地定位目标。第二个实验(N=12)评估了两种方法在需要上下文的任务中的有效性,我们将其定义为上下文浏览任务。结果表明,在情境浏览任务中,使用扭曲技术的被试能够更快、更准确地定位目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信