使用魔法镜头和过滤对图形内容进行可视化访问

Jakub Ukrop, Zuzana Cíková, Peter Kapec
{"title":"使用魔法镜头和过滤对图形内容进行可视化访问","authors":"Jakub Ukrop, Zuzana Cíková, Peter Kapec","doi":"10.1145/2448531.2448534","DOIUrl":null,"url":null,"abstract":"Graph visualization is a large and still evolving problem area in which new approaches appear. Graphs are often used to represent information that contains relations among data. Visual presentation of graphs aims at better graphs comprehension, however one problem in graph visualization is still present: how to effectively access the information stored in nodes and/or edges of graph. In this paper, we present our approach for visual accessing of graph content by using visual nodes. We also present how a hyper-graph based query language can be used in conjunction with magic lenses to lower visual clutter.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Visual access to graph content using magic lenses and filtering\",\"authors\":\"Jakub Ukrop, Zuzana Cíková, Peter Kapec\",\"doi\":\"10.1145/2448531.2448534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph visualization is a large and still evolving problem area in which new approaches appear. Graphs are often used to represent information that contains relations among data. Visual presentation of graphs aims at better graphs comprehension, however one problem in graph visualization is still present: how to effectively access the information stored in nodes and/or edges of graph. In this paper, we present our approach for visual accessing of graph content by using visual nodes. We also present how a hyper-graph based query language can be used in conjunction with magic lenses to lower visual clutter.\",\"PeriodicalId\":235681,\"journal\":{\"name\":\"Spring conference on Computer graphics\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Spring conference on Computer graphics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2448531.2448534\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Spring conference on Computer graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2448531.2448534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

图形可视化是一个巨大且仍在不断发展的问题领域,其中出现了新的方法。图通常用于表示包含数据之间关系的信息。图形可视化的目的是为了更好地理解图形,但是图形可视化的一个问题是如何有效地访问存储在图的节点或边缘上的信息。在本文中,我们提出了一种利用可视化节点对图形内容进行可视化访问的方法。我们还介绍了如何将基于超图的查询语言与magic lens结合使用以降低视觉混乱。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Visual access to graph content using magic lenses and filtering
Graph visualization is a large and still evolving problem area in which new approaches appear. Graphs are often used to represent information that contains relations among data. Visual presentation of graphs aims at better graphs comprehension, however one problem in graph visualization is still present: how to effectively access the information stored in nodes and/or edges of graph. In this paper, we present our approach for visual accessing of graph content by using visual nodes. We also present how a hyper-graph based query language can be used in conjunction with magic lenses to lower visual clutter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信