Dynamic Data Retrieval and Distance Decay of Triangulated Irregular Network(TIN) in Three Dimensional Visualizations

Wenji Zhao, T. Tang, H. Gong, Fuzhou Duan, Ying Mo
{"title":"Dynamic Data Retrieval and Distance Decay of Triangulated Irregular Network(TIN) in Three Dimensional Visualizations","authors":"Wenji Zhao, T. Tang, H. Gong, Fuzhou Duan, Ying Mo","doi":"10.1080/10824000609480613","DOIUrl":null,"url":null,"abstract":"Abstract This study presents two computational methods in improvement of large quantity data retrieval and display in 3D GIS virtual reality visualizations. The first method is dynamic data retrieval using quad-tree database structure and level of detail (LOD) algorism. The second is to dynamic simplify TIN mesh during a virtual travel. The streamlined data display was achieved combining partial data retrieval of original quad-tree according LOD parameters, and dynamic erase of nodes not necessary in the TIN as observational scene changes. The results indicated that the computational algorisms drastically increased retrieval and display speeds without compromise the quality of the visualizations.","PeriodicalId":331860,"journal":{"name":"Geographic Information Sciences","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Geographic Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10824000609480613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Abstract This study presents two computational methods in improvement of large quantity data retrieval and display in 3D GIS virtual reality visualizations. The first method is dynamic data retrieval using quad-tree database structure and level of detail (LOD) algorism. The second is to dynamic simplify TIN mesh during a virtual travel. The streamlined data display was achieved combining partial data retrieval of original quad-tree according LOD parameters, and dynamic erase of nodes not necessary in the TIN as observational scene changes. The results indicated that the computational algorisms drastically increased retrieval and display speeds without compromise the quality of the visualizations.
三维可视化中不规则三角网的动态数据检索和距离衰减
摘要针对三维GIS虚拟现实可视化中海量数据检索与显示的改进问题,提出了两种计算方法。第一种方法是利用四叉树数据库结构和详细层次(LOD)算法进行动态数据检索。二是在虚拟旅行中对TIN网格进行动态简化。根据LOD参数对原始四叉树进行部分数据检索,并随着观测场景的变化对TIN中不需要的节点进行动态擦除,实现了流线型数据显示。结果表明,在不影响可视化质量的情况下,计算算法大大提高了检索和显示速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信