互连通有向图的收敛图

Q3 Computer Science
Naoko Toeda , Rina Nakazawa , Takayuki Itoh , Takafumi Saito , Daniel Archambault
{"title":"互连通有向图的收敛图","authors":"Naoko Toeda ,&nbsp;Rina Nakazawa ,&nbsp;Takayuki Itoh ,&nbsp;Takafumi Saito ,&nbsp;Daniel Archambault","doi":"10.1016/j.jvlc.2017.09.004","DOIUrl":null,"url":null,"abstract":"<div><p>Directed graphs are used to represent a variety of datasets, including friendship on social networking services (SNS), pathways of genes, and citations of research papers. Graph drawing is useful in representing such datasets. At the international conference on Information Visualization (IV), we have presented a convergent edge drawing and a node layout technique for tightly and mutually connected directed graphs. The edge drawing technique in the IV paper includes three features: ordinary bundling of edges connecting pairs of node clusters, convergence of multiple bundles that connect to the same node cluster, and shape adjustment of two bundles connecting the same pair of node clusters. In this paper, we present improved node layout and edge drawing techniques, which make our edge bundling more effective. This paper also introduces a case study with a directed paper citation graph dataset.vvvvv</p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"43 ","pages":"Pages 83-90"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.004","citationCount":"4","resultStr":"{\"title\":\"Convergent drawing for mutually connected directed graphs\",\"authors\":\"Naoko Toeda ,&nbsp;Rina Nakazawa ,&nbsp;Takayuki Itoh ,&nbsp;Takafumi Saito ,&nbsp;Daniel Archambault\",\"doi\":\"10.1016/j.jvlc.2017.09.004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Directed graphs are used to represent a variety of datasets, including friendship on social networking services (SNS), pathways of genes, and citations of research papers. Graph drawing is useful in representing such datasets. At the international conference on Information Visualization (IV), we have presented a convergent edge drawing and a node layout technique for tightly and mutually connected directed graphs. The edge drawing technique in the IV paper includes three features: ordinary bundling of edges connecting pairs of node clusters, convergence of multiple bundles that connect to the same node cluster, and shape adjustment of two bundles connecting the same pair of node clusters. In this paper, we present improved node layout and edge drawing techniques, which make our edge bundling more effective. This paper also introduces a case study with a directed paper citation graph dataset.vvvvv</p></div>\",\"PeriodicalId\":54754,\"journal\":{\"name\":\"Journal of Visual Languages and Computing\",\"volume\":\"43 \",\"pages\":\"Pages 83-90\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.004\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Visual Languages and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1045926X17301659\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Visual Languages and Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1045926X17301659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 4

摘要

有向图用于表示各种数据集,包括社交网络服务(SNS)上的友谊、基因途径和研究论文的引用。图形绘制在表示此类数据集时很有用。在国际信息可视化会议(IV)上,我们提出了一种紧连通有向图的收敛边绘制和节点布局技术。第四篇论文中的边缘绘制技术包括三个特征:连接成对节点簇的边缘的普通捆绑、连接到同一节点簇的多个束的收敛以及连接同一对节点簇的两个束的形状调整。在本文中,我们提出了改进的节点布局和边缘绘制技术,使我们的边缘绑定更加有效。本文还介绍了一个有向论文引文图数据集的案例研究
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Convergent drawing for mutually connected directed graphs

Directed graphs are used to represent a variety of datasets, including friendship on social networking services (SNS), pathways of genes, and citations of research papers. Graph drawing is useful in representing such datasets. At the international conference on Information Visualization (IV), we have presented a convergent edge drawing and a node layout technique for tightly and mutually connected directed graphs. The edge drawing technique in the IV paper includes three features: ordinary bundling of edges connecting pairs of node clusters, convergence of multiple bundles that connect to the same node cluster, and shape adjustment of two bundles connecting the same pair of node clusters. In this paper, we present improved node layout and edge drawing techniques, which make our edge bundling more effective. This paper also introduces a case study with a directed paper citation graph dataset.vvvvv

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Visual Languages and Computing
Journal of Visual Languages and Computing 工程技术-计算机:软件工程
CiteScore
1.62
自引率
0.00%
发文量
0
审稿时长
26.8 weeks
期刊介绍: The Journal of Visual Languages and Computing is a forum for researchers, practitioners, and developers to exchange ideas and results for the advancement of visual languages and its implication to the art of computing. The journal publishes research papers, state-of-the-art surveys, and review articles in all aspects of visual languages.
×
引用
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学术官方微信