Voronoi树图在曼哈顿距离和切比雪夫距离

IF 1.8 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Yan Chao Wang, Yi Xing, J. Zhang
{"title":"Voronoi树图在曼哈顿距离和切比雪夫距离","authors":"Yan Chao Wang, Yi Xing, J. Zhang","doi":"10.1177/14738716231167181","DOIUrl":null,"url":null,"abstract":"The ordinary Voronoi treemap generated based on the Euclidean distance function has the flexibility to slightly adjust the layout when visualizing time-varying hierarchical data for better visual quality, preserving neighborhood relationships, and preserving a stable layout. However, its layout formed by segments with arbitrary orientations has poor shape stability between successive layouts at different time indexes, which is not conducive for the users to understand the plot and track the same node. In this paper, we propose novel Voronoi treemaps in Manhattan distance and Chebyshev distance respectively, such that the segments in the new layouts only have four orientations (horizontal, vertical, and ±45° to the x -axis). The new layouts can not only heritage the abilities of ordinary Voronoi treemap, but preserve good shape stability. To achieve this, we first focus on the weighted bisector between two sites in Manhattan distance and design a bisector generation method for different weight values of two sites, as the bisector is the foundation to form a diagram. Then a divide-and-conquer method is utilized to form the bisectors into a Voronoi diagram, and a Voronoi treemap layout can be finally obtained by using Lloyd’s method to iteratively adjust the diagram. Moreover, we prove that the treemap algorithm in Manhattan distance can be adjusted to also generate the Voronoi treemap in Chebyshev distance via linear transformation, avoiding designing additional algorithm. The computational properties of the proposed methods are first evaluated to check whether the layouts can be generated fast and accurately. Then the perceptual properties are evaluated quantitatively and qualitatively based on quality metrics and user studies, respectively. The results demonstrate that the proposed Voronoi treemaps preserve similar layout stability, but better visual quality and shape stability than the ordinary Voronoi treemap. Our algorithms are simple and resolution-independent, but also provide alternatives to the Voronoi treemaps.","PeriodicalId":50360,"journal":{"name":"Information Visualization","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Voronoi treemap in Manhattan distance and Chebyshev distance\",\"authors\":\"Yan Chao Wang, Yi Xing, J. Zhang\",\"doi\":\"10.1177/14738716231167181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ordinary Voronoi treemap generated based on the Euclidean distance function has the flexibility to slightly adjust the layout when visualizing time-varying hierarchical data for better visual quality, preserving neighborhood relationships, and preserving a stable layout. However, its layout formed by segments with arbitrary orientations has poor shape stability between successive layouts at different time indexes, which is not conducive for the users to understand the plot and track the same node. In this paper, we propose novel Voronoi treemaps in Manhattan distance and Chebyshev distance respectively, such that the segments in the new layouts only have four orientations (horizontal, vertical, and ±45° to the x -axis). The new layouts can not only heritage the abilities of ordinary Voronoi treemap, but preserve good shape stability. To achieve this, we first focus on the weighted bisector between two sites in Manhattan distance and design a bisector generation method for different weight values of two sites, as the bisector is the foundation to form a diagram. Then a divide-and-conquer method is utilized to form the bisectors into a Voronoi diagram, and a Voronoi treemap layout can be finally obtained by using Lloyd’s method to iteratively adjust the diagram. Moreover, we prove that the treemap algorithm in Manhattan distance can be adjusted to also generate the Voronoi treemap in Chebyshev distance via linear transformation, avoiding designing additional algorithm. The computational properties of the proposed methods are first evaluated to check whether the layouts can be generated fast and accurately. Then the perceptual properties are evaluated quantitatively and qualitatively based on quality metrics and user studies, respectively. The results demonstrate that the proposed Voronoi treemaps preserve similar layout stability, but better visual quality and shape stability than the ordinary Voronoi treemap. Our algorithms are simple and resolution-independent, but also provide alternatives to the Voronoi treemaps.\",\"PeriodicalId\":50360,\"journal\":{\"name\":\"Information Visualization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Visualization\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1177/14738716231167181\",\"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/14738716231167181","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 1

摘要

基于欧几里得距离函数生成的普通Voronoi树图在可视化时变分层数据时具有略微调整布局的灵活性,以获得更好的视觉质量,保持邻域关系,并保持稳定的布局。然而,其由任意方向的片段形成的布局在不同时间索引的连续布局之间的形状稳定性较差,不利于用户理解情节和跟踪同一节点。在本文中,我们分别在曼哈顿距离和切比雪夫距离上提出了新的Voronoi树图,使得新布局中的线段只有四个方向(水平、垂直和与x轴±45°)。新的布局不仅可以继承普通Voronoi树图的功能,还可以保持良好的形状稳定性。为了实现这一点,我们首先关注曼哈顿距离内两个站点之间的加权平分线,并针对两个站点的不同权值设计了一种平分线生成方法,因为平分线是形成图表的基础。然后利用分治法将平分线形成Voronoi图,并利用Lloyd方法迭代调整图,最终得到Voronoi树图布局。此外,我们证明了曼哈顿距离的树图算法可以通过线性变换调整为切比雪夫距离的Voronoi树图,从而避免了设计额外的算法。首先评估所提出方法的计算特性,以检查布局是否能够快速准确地生成。然后分别基于质量度量和用户研究对感知特性进行定量和定性评估。结果表明,与普通的Voronoi树图相比,所提出的Voronai树图保持了相似的布局稳定性,但具有更好的视觉质量和形状稳定性。我们的算法简单且与分辨率无关,但也提供了Voronoi树图的替代方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Voronoi treemap in Manhattan distance and Chebyshev distance
The ordinary Voronoi treemap generated based on the Euclidean distance function has the flexibility to slightly adjust the layout when visualizing time-varying hierarchical data for better visual quality, preserving neighborhood relationships, and preserving a stable layout. However, its layout formed by segments with arbitrary orientations has poor shape stability between successive layouts at different time indexes, which is not conducive for the users to understand the plot and track the same node. In this paper, we propose novel Voronoi treemaps in Manhattan distance and Chebyshev distance respectively, such that the segments in the new layouts only have four orientations (horizontal, vertical, and ±45° to the x -axis). The new layouts can not only heritage the abilities of ordinary Voronoi treemap, but preserve good shape stability. To achieve this, we first focus on the weighted bisector between two sites in Manhattan distance and design a bisector generation method for different weight values of two sites, as the bisector is the foundation to form a diagram. Then a divide-and-conquer method is utilized to form the bisectors into a Voronoi diagram, and a Voronoi treemap layout can be finally obtained by using Lloyd’s method to iteratively adjust the diagram. Moreover, we prove that the treemap algorithm in Manhattan distance can be adjusted to also generate the Voronoi treemap in Chebyshev distance via linear transformation, avoiding designing additional algorithm. The computational properties of the proposed methods are first evaluated to check whether the layouts can be generated fast and accurately. Then the perceptual properties are evaluated quantitatively and qualitatively based on quality metrics and user studies, respectively. The results demonstrate that the proposed Voronoi treemaps preserve similar layout stability, but better visual quality and shape stability than the ordinary Voronoi treemap. Our algorithms are simple and resolution-independent, but also provide alternatives to the Voronoi treemaps.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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).
×
引用
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学术官方微信