轻量级WebGL渲染优化的类连续LOD算法

Jiandong Wang, Xiang Xia, Zhiwei Zhang, Yuanyu Zhang, Yulong Shen, Baoquan Ren
{"title":"轻量级WebGL渲染优化的类连续LOD算法","authors":"Jiandong Wang, Xiang Xia, Zhiwei Zhang, Yuanyu Zhang, Yulong Shen, Baoquan Ren","doi":"10.1109/NaNA56854.2022.00090","DOIUrl":null,"url":null,"abstract":"WebGL is one of the most promising implementations of 3D visualization and can be accessed across platforms. However, rendering a large scene using WebGL requires a lot of computational overhead because every vertex of the model in the scene needs to be calculated. Traditional WebGL rendering solutions include discrete and continuous Levels of Detail (LOD) algorithms. Discrete algorithms display models with different details in segments, causing the problem of model mutation. Although continuous algorithms can generate models with similar details to solve the problem of model mutation, the model distortion problem is introduced when the model details are low. In this paper, a Class Continuous LOD (CCLOD) algorithm for lightweight rendering is proposed, which dynamically adjusts model details according to the visual distance, and reduces the computational overhead of rendering by reducing model details while keeping consistent visual effect. In order to solve the problem of model mutation and distortion in the LOD algorithm, the CCLOD algorithm puts forward relevant constraints on the process of adjusting model details. According to these constraints, a collapse proportion generation algorithm is proposed. The collapse proportion is generated by using the distance between objects, and the low-cost triangles of the model are deleted according to the collapse proportion to generate a model with continuous details. It makes the transition between multi-level models smoother to avoid model mutation and limits the max-imum collapse ratio to avoid model distortion. Experimental results show that compared with the traditional LOD algorithm, the CCLOD algorithm reduces the number of triangles by 12.66% and the video memory usage by 17.5%.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"283 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Class Continuous LOD Algorithm for Lightweight WebGL Rendering Optimization\",\"authors\":\"Jiandong Wang, Xiang Xia, Zhiwei Zhang, Yuanyu Zhang, Yulong Shen, Baoquan Ren\",\"doi\":\"10.1109/NaNA56854.2022.00090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"WebGL is one of the most promising implementations of 3D visualization and can be accessed across platforms. However, rendering a large scene using WebGL requires a lot of computational overhead because every vertex of the model in the scene needs to be calculated. Traditional WebGL rendering solutions include discrete and continuous Levels of Detail (LOD) algorithms. Discrete algorithms display models with different details in segments, causing the problem of model mutation. Although continuous algorithms can generate models with similar details to solve the problem of model mutation, the model distortion problem is introduced when the model details are low. In this paper, a Class Continuous LOD (CCLOD) algorithm for lightweight rendering is proposed, which dynamically adjusts model details according to the visual distance, and reduces the computational overhead of rendering by reducing model details while keeping consistent visual effect. In order to solve the problem of model mutation and distortion in the LOD algorithm, the CCLOD algorithm puts forward relevant constraints on the process of adjusting model details. According to these constraints, a collapse proportion generation algorithm is proposed. The collapse proportion is generated by using the distance between objects, and the low-cost triangles of the model are deleted according to the collapse proportion to generate a model with continuous details. It makes the transition between multi-level models smoother to avoid model mutation and limits the max-imum collapse ratio to avoid model distortion. Experimental results show that compared with the traditional LOD algorithm, the CCLOD algorithm reduces the number of triangles by 12.66% and the video memory usage by 17.5%.\",\"PeriodicalId\":113743,\"journal\":{\"name\":\"2022 International Conference on Networking and Network Applications (NaNA)\",\"volume\":\"283 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Networking and Network Applications (NaNA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaNA56854.2022.00090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA56854.2022.00090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

WebGL是最有前途的3D可视化实现之一,可以跨平台访问。然而,使用WebGL渲染大型场景需要大量的计算开销,因为场景中模型的每个顶点都需要计算。传统的WebGL渲染解决方案包括离散和连续的细节层次(LOD)算法。离散算法在片段中显示不同细节的模型,造成模型突变问题。虽然连续算法可以生成具有相似细节的模型来解决模型突变问题,但当模型细节较低时,会引入模型畸变问题。本文提出了一种基于类连续LOD (Class Continuous LOD, CCLOD)的轻量化渲染算法,该算法根据视觉距离动态调整模型细节,在保持视觉效果一致的情况下通过减少模型细节来减少渲染的计算开销。为了解决LOD算法中的模型突变和失真问题,CCLOD算法对模型细节调整过程提出了相关约束。根据这些约束条件,提出了一种折叠比例生成算法。利用物体之间的距离生成折叠比例,并根据折叠比例删除模型的低成本三角形,生成具有连续细节的模型。它使多层模型之间的过渡更加平滑,避免了模型突变;限制了最大崩溃比,避免了模型失真。实验结果表明,与传统的LOD算法相比,CCLOD算法减少了12.66%的三角形数量,节省了17.5%的显存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Class Continuous LOD Algorithm for Lightweight WebGL Rendering Optimization
WebGL is one of the most promising implementations of 3D visualization and can be accessed across platforms. However, rendering a large scene using WebGL requires a lot of computational overhead because every vertex of the model in the scene needs to be calculated. Traditional WebGL rendering solutions include discrete and continuous Levels of Detail (LOD) algorithms. Discrete algorithms display models with different details in segments, causing the problem of model mutation. Although continuous algorithms can generate models with similar details to solve the problem of model mutation, the model distortion problem is introduced when the model details are low. In this paper, a Class Continuous LOD (CCLOD) algorithm for lightweight rendering is proposed, which dynamically adjusts model details according to the visual distance, and reduces the computational overhead of rendering by reducing model details while keeping consistent visual effect. In order to solve the problem of model mutation and distortion in the LOD algorithm, the CCLOD algorithm puts forward relevant constraints on the process of adjusting model details. According to these constraints, a collapse proportion generation algorithm is proposed. The collapse proportion is generated by using the distance between objects, and the low-cost triangles of the model are deleted according to the collapse proportion to generate a model with continuous details. It makes the transition between multi-level models smoother to avoid model mutation and limits the max-imum collapse ratio to avoid model distortion. Experimental results show that compared with the traditional LOD algorithm, the CCLOD algorithm reduces the number of triangles by 12.66% and the video memory usage by 17.5%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信