虚拟现实引擎中可见性裁减的一种解决方法  

A SOLUTION FOR VISIBILITY CULLING IN VIRTUAL REALITY ENGINE

作　　者：高丽娜[1] 

机构地区：[1]渤海大学公共计算机教研部,辽宁锦州121000

出　　处：《计算机应用与软件》2009年第1期242-243,266,共3页Computer Applications and Software

摘　　要：可见性裁减是计算机图形学的基本问题,也是虚拟现实引擎中的一个关键技术。在解决可见性裁减问题时,将Durand提出的扩展投影作为保守可见性预处理的算法与Greene等人提出的层次遮挡图和层次深度图的算法相结合,根据层次遮挡图来判断被遮挡物是否可见,并对算法中视点单元的大小和遮挡板的数量对裁减结果的影响作了分析。Visibility culling is a fundamental problem in computer graphics as well as a key technique in virtual reality engine. When solving the problem of the visibility culling, the extended projection proposed by Durand as the algorithm of conservative visibility preprocessing was combined with the algorithm of hierachical occlusion map and hierachical depth map proposed b）, Greene et. al, to judge whether the occluded object can be viewed or not according to hierachical occlusion map. The impact on the culling results imposed by the view cell size and the occluder number in the algorithm had been analyzed as well.

关 键 词：可见性裁减 扩展投影 层次遮挡图 层次深度图 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术] O185.2[自动化与计算机技术—计算机科学与技术]