一种基于八叉树空间剖分技术的光线跟踪算法  

Ray tracing algorithm based on octree space partition method

作　　者：王文玺[1] 肖世德[1] 孟文[1] 董鸿[2] 

机构地区：[1]西南交通大学智能机电技术研究所,成都610031 [2]电子科技大学光电信息学院,成都610031

出　　处：《计算机应用》2008年第3期656-658,共3页journal of Computer Applications

摘　　要：光线跟踪算法是生成真实感图形的主要算法之一。为了提高光线追踪速度,在研究和比较各种光线跟踪算法的基础上,提出了一种基于八叉树数据结构的光线追踪算法。并结合基于重心坐标系的快速求交算法来提高光线跟踪的求交效率,使用重心坐标来表示包含三角形面片的参数平面,不用像三角形顶点一样需要长期存储,能够快速判定光线与三角形是否相交并计算出交点。实验结果表明,该算法能够在保证图像质量的同时提高绘制速度。Ray tracing algorithm is one of the main algorithms of creating the real graphic. To improve the speed, accelerating algorithm for ray tracing was studied and compared and a ray tracing algorithm based on octree data structure was presented. The intersecting algorithm based on barycentric coordinate can advance the intersection efficiency. Using barycentric coordinate to express triangular parameter surfaces does not need long-term storage as the planar triangle does, and can quickly tell whether the triangular intersects with the light and calculate the intersection. Experiments show that the algorithm can guarantee image quality and improving the rendering speed.

关 键 词：真实感图形 光线跟踪 八叉树 重心坐标系 求交算法 

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