基于改进型遮挡查询的复杂场景漫游算法  

A WALKTHROUGH ALGORITHM FOR COMPLEX SCENE BASED ON IMPROVED OCCLUSION QUERY

作　　者：王海颍[1] 

机构地区：[1]中国电子信息产业发展研究院,北京100048

出　　处：《计算机应用与软件》2011年第7期243-245,300,共4页Computer Applications and Software

摘　　要：场景漫游中存在大量复杂模型时,由于其巨大的几何与纹理数据量,渲染速度会随之显著变慢。提出一种改进的大规模场景实时漫游技术,有效地利用了GPU的硬件遮挡查询技术。与以往的方法相比,通过一种改进的可见性分类查询队列,能同时减少遮挡查询次数和渲染状态的改变;并使用一种简单有效的排序方法,解决了同类方法中出现的遮挡错误的问题。实验证明该方法能有效提高复杂场景下漫游的渲染速度。When the scene walkthrough includes many complex models,the speed of rendering will be reduced remarkably,for there are huge geometry and texture data in it.In this paper,we present an improved large-scale real-time scene walkthrough technique which effectually utilises the hardware occlusion query of GPU.Compared with previous methods,this approach can reduce the times of occlusion queries and the variation of rendering state simultaneously by an improved visible classification query queue;moreover,it uses a simple and effective sorting way to have resolved the occlusion error problem encountered in other similar methods.Experiment proves that the technique is able to effectively enhance the rendering speed of the walkthrough in complex scene.

关 键 词：实时漫游 遮挡查询 复杂场景 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]