基于Voronoi镶嵌的聚类网络无重叠标记

Q3 Computer Science
Hsiang-Yun Wu , Shigeo Takahashi , Rie Ishida
{"title":"基于Voronoi镶嵌的聚类网络无重叠标记","authors":"Hsiang-Yun Wu ,&nbsp;Shigeo Takahashi ,&nbsp;Rie Ishida","doi":"10.1016/j.jvlc.2017.09.008","DOIUrl":null,"url":null,"abstract":"<div><p>Properly drawing clustered networks significantly improves the visual readability of the meaningful structures hidden behind the associated abstract relationships. Nonetheless, we often degrade the visual quality of such clustered graphs when we try to annotate the network nodes with text labels due to their unwanted mutual overlap. In this paper, we present an approach for aesthetically sparing labeling space around nodes of clustered networks by introducing a space partitioning technique. The key idea of our approach is to adaptively blend an aesthetic network layout based on conventional criteria with that obtained through centroidal Voronoi tessellation. Our technical contribution lies in choosing a specific distance metric in order to respect the aspect ratios of rectangular labels, together with a new scheme for adaptively exploring the proper balance between the two network layouts around each node. Centrality-based clustering is also incorporated into our approach in order to elucidate the underlying hierarchical structure embedded in the given network data, which also allows for the manual design of its overall layout according to visual requirements and preferences. The accompanying experimental results demonstrate that our approach can effectively mitigate visual clutter caused by the label overlaps in several important types of networks.</p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"44 ","pages":"Pages 106-119"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.008","citationCount":"1","resultStr":"{\"title\":\"Overlap-free labeling of clustered networks based on Voronoi tessellation\",\"authors\":\"Hsiang-Yun Wu ,&nbsp;Shigeo Takahashi ,&nbsp;Rie Ishida\",\"doi\":\"10.1016/j.jvlc.2017.09.008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Properly drawing clustered networks significantly improves the visual readability of the meaningful structures hidden behind the associated abstract relationships. Nonetheless, we often degrade the visual quality of such clustered graphs when we try to annotate the network nodes with text labels due to their unwanted mutual overlap. In this paper, we present an approach for aesthetically sparing labeling space around nodes of clustered networks by introducing a space partitioning technique. The key idea of our approach is to adaptively blend an aesthetic network layout based on conventional criteria with that obtained through centroidal Voronoi tessellation. Our technical contribution lies in choosing a specific distance metric in order to respect the aspect ratios of rectangular labels, together with a new scheme for adaptively exploring the proper balance between the two network layouts around each node. Centrality-based clustering is also incorporated into our approach in order to elucidate the underlying hierarchical structure embedded in the given network data, which also allows for the manual design of its overall layout according to visual requirements and preferences. The accompanying experimental results demonstrate that our approach can effectively mitigate visual clutter caused by the label overlaps in several important types of networks.</p></div>\",\"PeriodicalId\":54754,\"journal\":{\"name\":\"Journal of Visual Languages and Computing\",\"volume\":\"44 \",\"pages\":\"Pages 106-119\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.008\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Visual Languages and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1045926X17301830\",\"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/S1045926X17301830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 1

摘要

正确绘制集群网络显著提高了隐藏在相关抽象关系后面的有意义结构的视觉可读性。尽管如此,当我们试图用文本标签注释网络节点时,由于它们不必要的相互重叠,我们经常会降低这种聚类图的视觉质量。在本文中,我们提出了一种通过引入空间划分技术来美观地节省集群网络节点周围的标记空间的方法。我们方法的关键思想是自适应地混合基于传统标准的美学网络布局与通过质心Voronoi镶嵌获得的布局。我们的技术贡献在于选择一个特定的距离度量,以尊重矩形标签的纵横比,以及一种自适应地探索每个节点周围两个网络布局之间适当平衡的新方案。基于中心性的聚类也被纳入我们的方法中,以阐明嵌入给定网络数据中的底层分层结构,这也允许根据视觉需求和偏好手动设计其总体布局。附带的实验结果表明,我们的方法可以有效地减轻由几种重要类型的网络中的标签重叠引起的视觉混乱。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Overlap-free labeling of clustered networks based on Voronoi tessellation

Properly drawing clustered networks significantly improves the visual readability of the meaningful structures hidden behind the associated abstract relationships. Nonetheless, we often degrade the visual quality of such clustered graphs when we try to annotate the network nodes with text labels due to their unwanted mutual overlap. In this paper, we present an approach for aesthetically sparing labeling space around nodes of clustered networks by introducing a space partitioning technique. The key idea of our approach is to adaptively blend an aesthetic network layout based on conventional criteria with that obtained through centroidal Voronoi tessellation. Our technical contribution lies in choosing a specific distance metric in order to respect the aspect ratios of rectangular labels, together with a new scheme for adaptively exploring the proper balance between the two network layouts around each node. Centrality-based clustering is also incorporated into our approach in order to elucidate the underlying hierarchical structure embedded in the given network data, which also allows for the manual design of its overall layout according to visual requirements and preferences. The accompanying experimental results demonstrate that our approach can effectively mitigate visual clutter caused by the label overlaps in several important types of networks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信