动态图形中连接组件的稳定可视化

IF 1.8 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Information Visualization Pub Date : 2020-11-24 DOI:10.1177/1473871620972339
E. D. Giacomo, W. Didimo, M. Kaufmann, G. Liotta
{"title":"动态图形中连接组件的稳定可视化","authors":"E. D. Giacomo, W. Didimo, M. Kaufmann, G. Liotta","doi":"10.1177/1473871620972339","DOIUrl":null,"url":null,"abstract":"One of the primary goals of many systems for the visual analysis of dynamically changing networks is to maintain the stability of the drawing throughout the sequence of graph changes. We investigate the scenario where the changes are determined by a stream of events, each being either an edge addition or an edge removal. The visualization must be updated immediately after each new event is received. Our main goal is to provide the user with an intuitive visualization that highlights the different connected components of the graph while preserving the user’s mental map after each event. The drawing stability is measured in terms of changes in the orthogonal relationships between vertices of two consecutive drawings. We describe two different visualization models, one for the 1-dimensional space and the other for the 2-dimensional space. In both models the connected components are drawn inside rectangular regions. To validate our approach, we report the results of an experimental analysis that compares the drawing stability of the online algorithm with that of an offline algorithm that knows in advance the whole sequence of events. We also present a case study of our online algorithm on a collaboration network.","PeriodicalId":50360,"journal":{"name":"Information Visualization","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2020-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1177/1473871620972339","citationCount":"2","resultStr":"{\"title\":\"Stable visualization of connected components in dynamic graphs\",\"authors\":\"E. D. Giacomo, W. Didimo, M. Kaufmann, G. Liotta\",\"doi\":\"10.1177/1473871620972339\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the primary goals of many systems for the visual analysis of dynamically changing networks is to maintain the stability of the drawing throughout the sequence of graph changes. We investigate the scenario where the changes are determined by a stream of events, each being either an edge addition or an edge removal. The visualization must be updated immediately after each new event is received. Our main goal is to provide the user with an intuitive visualization that highlights the different connected components of the graph while preserving the user’s mental map after each event. The drawing stability is measured in terms of changes in the orthogonal relationships between vertices of two consecutive drawings. We describe two different visualization models, one for the 1-dimensional space and the other for the 2-dimensional space. In both models the connected components are drawn inside rectangular regions. To validate our approach, we report the results of an experimental analysis that compares the drawing stability of the online algorithm with that of an offline algorithm that knows in advance the whole sequence of events. We also present a case study of our online algorithm on a collaboration network.\",\"PeriodicalId\":50360,\"journal\":{\"name\":\"Information Visualization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2020-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1177/1473871620972339\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Visualization\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1177/1473871620972339\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Visualization","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1177/1473871620972339","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 2

摘要

用于动态变化网络的可视化分析的许多系统的主要目标之一是在图形变化的整个序列中保持绘图的稳定性。我们研究了由一系列事件决定变化的场景,每个事件要么是边缘添加,要么是边缘移除。可视化必须在收到每个新事件后立即更新。我们的主要目标是为用户提供直观的可视化,突出显示图形的不同连接组件,同时在每次事件后保留用户的心理地图。绘图稳定性是根据两个连续绘图的顶点之间的正交关系的变化来测量的。我们描述了两种不同的可视化模型,一种用于一维空间,另一种用于二维空间。在这两个模型中,连接的零部件都绘制在矩形区域内。为了验证我们的方法,我们报告了一项实验分析的结果,该分析比较了在线算法和离线算法的绘图稳定性,离线算法提前知道整个事件序列。我们还介绍了我们在协作网络上的在线算法的案例研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Stable visualization of connected components in dynamic graphs
One of the primary goals of many systems for the visual analysis of dynamically changing networks is to maintain the stability of the drawing throughout the sequence of graph changes. We investigate the scenario where the changes are determined by a stream of events, each being either an edge addition or an edge removal. The visualization must be updated immediately after each new event is received. Our main goal is to provide the user with an intuitive visualization that highlights the different connected components of the graph while preserving the user’s mental map after each event. The drawing stability is measured in terms of changes in the orthogonal relationships between vertices of two consecutive drawings. We describe two different visualization models, one for the 1-dimensional space and the other for the 2-dimensional space. In both models the connected components are drawn inside rectangular regions. To validate our approach, we report the results of an experimental analysis that compares the drawing stability of the online algorithm with that of an offline algorithm that knows in advance the whole sequence of events. We also present a case study of our online algorithm on a collaboration network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Visualization
Information Visualization COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
5.40
自引率
0.00%
发文量
16
审稿时长
>12 weeks
期刊介绍: Information Visualization is essential reading for researchers and practitioners of information visualization and is of interest to computer scientists and data analysts working on related specialisms. This journal is an international, peer-reviewed journal publishing articles on fundamental research and applications of information visualization. The journal acts as a dedicated forum for the theories, methodologies, techniques and evaluations of information visualization and its applications. The journal is a core vehicle for developing a generic research agenda for the field by identifying and developing the unique and significant aspects of information visualization. Emphasis is placed on interdisciplinary material and on the close connection between theory and practice. This journal is a member of the Committee on Publication Ethics (COPE).
期刊最新文献
Multidimensional data visualization and synchronization for revealing hidden pandemic information Interactive visual formula composition of multidimensional data classifiers Exploring annotation taxonomy in grouped bar charts: A qualitative classroom study Designing complex network visualisations using the wayfinding map metaphor Graph & Network Visualization and Beyond
×
引用
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