基于避障的类别数据可视化

Rongtao Qian, Sitong Fang, Yinhui Ge, Lijun Wang, Yuzhe Xiang
{"title":"基于避障的类别数据可视化","authors":"Rongtao Qian, Sitong Fang, Yinhui Ge, Lijun Wang, Yuzhe Xiang","doi":"10.1109/ICPDS47662.2019.9017167","DOIUrl":null,"url":null,"abstract":"Obstacle avoidance algorithm is often used in data visualization to connect lines between data items or perform route planning in 3D volume visualization. The traditional obstacle avoidance algorithm is often designed to find a shortest path between two data items. It is not suitable to be used in visualization, because it needs to achieve a more artistic and smooth effect. Well-designed visualization often provides user-friendly, effective, and efficient manipulations and interactions. In this paper, we use an obstacle avoidance algorithm to connect lines between data items, which can be used to visualize set information present in category data (or set data). Specifically, we use A-star algorithm to conduct obstacle avoidance between data items, then we make the lines more artistic and smooth by introducing a series pivot points. Finally, we visualize the data items by connecting the lines to show the category information and sub-category information or other information. Experiments show that the proposed approach is capable of revealing the set information present in category data.","PeriodicalId":130202,"journal":{"name":"2019 IEEE International Conference on Power Data Science (ICPDS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Category Data Visualization Based on Obstacle Avoidances\",\"authors\":\"Rongtao Qian, Sitong Fang, Yinhui Ge, Lijun Wang, Yuzhe Xiang\",\"doi\":\"10.1109/ICPDS47662.2019.9017167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Obstacle avoidance algorithm is often used in data visualization to connect lines between data items or perform route planning in 3D volume visualization. The traditional obstacle avoidance algorithm is often designed to find a shortest path between two data items. It is not suitable to be used in visualization, because it needs to achieve a more artistic and smooth effect. Well-designed visualization often provides user-friendly, effective, and efficient manipulations and interactions. In this paper, we use an obstacle avoidance algorithm to connect lines between data items, which can be used to visualize set information present in category data (or set data). Specifically, we use A-star algorithm to conduct obstacle avoidance between data items, then we make the lines more artistic and smooth by introducing a series pivot points. Finally, we visualize the data items by connecting the lines to show the category information and sub-category information or other information. Experiments show that the proposed approach is capable of revealing the set information present in category data.\",\"PeriodicalId\":130202,\"journal\":{\"name\":\"2019 IEEE International Conference on Power Data Science (ICPDS)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Power Data Science (ICPDS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPDS47662.2019.9017167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Power Data Science (ICPDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPDS47662.2019.9017167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在三维体可视化中,避障算法通常用于数据项之间的连线或进行路径规划。传统的避障算法通常被设计为寻找两个数据项之间的最短路径。它不适合在可视化中使用,因为它需要达到更艺术和流畅的效果。设计良好的可视化通常提供用户友好的、有效的和高效的操作和交互。在本文中,我们使用了一种避障算法来连接数据项之间的线,这可以用来可视化类别数据(或集合数据)中存在的集合信息。具体来说,我们使用a -star算法在数据项之间进行避障,然后通过引入一系列轴心点使线条更加美观和平滑。最后,我们通过连接线将数据项可视化,以显示类别信息和子类别信息或其他信息。实验表明,该方法能够很好地揭示类别数据中存在的集合信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Category Data Visualization Based on Obstacle Avoidances
Obstacle avoidance algorithm is often used in data visualization to connect lines between data items or perform route planning in 3D volume visualization. The traditional obstacle avoidance algorithm is often designed to find a shortest path between two data items. It is not suitable to be used in visualization, because it needs to achieve a more artistic and smooth effect. Well-designed visualization often provides user-friendly, effective, and efficient manipulations and interactions. In this paper, we use an obstacle avoidance algorithm to connect lines between data items, which can be used to visualize set information present in category data (or set data). Specifically, we use A-star algorithm to conduct obstacle avoidance between data items, then we make the lines more artistic and smooth by introducing a series pivot points. Finally, we visualize the data items by connecting the lines to show the category information and sub-category information or other information. Experiments show that the proposed approach is capable of revealing the set information present in category data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信