基于遮挡物的可见性算法研究  

作　　者：冯海波[1] 张建中[1] 

机构地区：[1]电子科技大学,四川成都610054

出　　处：《成都电子机械高等专科学校学报》2007年第2期1-4,共4页Journal of Chengdu Electromechanical College

摘　　要：在计算机三维图形中,可见面的检测算法对于三维场景的绘制效果和速度非常关键,而对于不同的场景,很难找到通用的算法对场景进行可见面检测。本文通过对各种场景的可见面检测算法的比较研究,对于景物密集的复杂场景,提出一种基于遮挡物的可见性算法。该算法结合了基于BSP的空间划分算法,这使该可见性算法在按从前到后的顺序绘制场景时具有高效率。In 3D computer graphics, visibility algorithm is very important for 3D scene rendering. For different scenes, it＇s hard to find a generic visibility algorithm in visible surface determination. In this article, according to comparing some kinds of visibility algorithm, a vis- ibility algorithm based on occluder for complicated scene with high density is presented. The algorithm performs very high efficiency when the scene user designed is organized according to Binary Space Partition tree and rendered from front to back.

关 键 词：遮挡物 可见性 图形学 Beam树 BSP 

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