Adaptive view-dependent tree graph visualization

H. Miyamura, S. Ohzahata, Y. Shinano, Ryuhei Miyashiro
{"title":"Adaptive view-dependent tree graph visualization","authors":"H. Miyamura, S. Ohzahata, Y. Shinano, Ryuhei Miyashiro","doi":"10.1109/JCSSE.2011.5930118","DOIUrl":null,"url":null,"abstract":"This paper proposes an adaptive visualization technique for representing a large-scale hierarchical dataset within a limited display space. A hierarchical dataset has nodes and links that reveal the parent-child relationship between the nodes. These nodes and links are described using graphics primitives. When the number of these primitives is large, it is difficult to recognize the structure of the hierarchical data because several primitives overlap within a display space. In order To overcome this difficulty, we propose an adaptive visualization technique for hierarchical datasets. The proposed technique selects an appropriate graph style according to the nodal density in each area.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2011.5930118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper proposes an adaptive visualization technique for representing a large-scale hierarchical dataset within a limited display space. A hierarchical dataset has nodes and links that reveal the parent-child relationship between the nodes. These nodes and links are described using graphics primitives. When the number of these primitives is large, it is difficult to recognize the structure of the hierarchical data because several primitives overlap within a display space. In order To overcome this difficulty, we propose an adaptive visualization technique for hierarchical datasets. The proposed technique selects an appropriate graph style according to the nodal density in each area.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自适应依赖于视图的树形图可视化
本文提出了一种在有限显示空间内表示大规模分层数据集的自适应可视化技术。分层数据集具有节点和链接,这些节点和链接显示节点之间的父子关系。这些节点和链接使用图形原语进行描述。当这些原语的数量很大时,很难识别分层数据的结构,因为多个原语在一个显示空间内重叠。为了克服这一困难,我们提出了一种分层数据集的自适应可视化技术。该技术根据每个区域的节点密度选择合适的图形样式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transforming state tables to Coloured Petri nets for automatic verification of internet protocols Clustering by attraction and distraction Event recognition from information-linkage based using phrase tree traversal Towards a complete project oriented risk management model: A refinement of PRORISK Solving software module clustering problem by evolutionary algorithms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1