线索化包围盒层次结构的并行创建算法  

Parallel construction algorithm for threaded-BVH

作　　者：陈纯毅[1,2] 杨华民[2] 李文辉[1] 范静涛[2] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012 [2]长春理工大学计算机科学技术学院,长春130022

出　　处：《吉林大学学报（工学版）》2011年第5期1388-1393,共6页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家科技支撑计划项目(2009BAE69B01)

摘　　要：针对光线跟踪的场景加速结构创建问题,提出一种线索化包围盒层次结构(BVH)的图形处理器并行创建算法。算法完全以宽度优先搜索顺序创建包围盒结点,包括大结点和小结点两个创建过程,其分别并行化面片运算和结点运算,解决了创建上层结点时缺乏数据并行度的问题。算法通过3个独立步骤实现BVH的宽度优先到深度优先存储结构变换以及包围盒结点的线索化操作。实验结果表明,本文算法的创建速度高于已有的非线索化BVH创建算法。Focusing on the issues of creating acceleration-structures of 3D scenes for ray tracing,a GPU-based parallel construction algorithm for threaded-Biovision Hierarchy（BVH） was proposed.The algorithm builds the Bounding-Volume Nodes（BVNs） completely in a breadth-first search order and includes two BVN construction processes.The first process is for upper large nodes,which parallelizes the computation over geometric primitives in each node,and the second is for lower small nodes,which parallelizes the computation over nodes at each level.These parallelization strategies can solve the problem of lacking parallelism in the construction process of upper large nodes.The algorithm performs operations of the BVH storage-structure transformation from the breadth-first to the depth-first order and threading computation of BVNs in three individual steps.Experiment results show that the construction speed of the proposed algorithm is faster than the existing unthreaded-BVH construction algorithm.

关 键 词：计算机应用 包围盒层次结构 线索化 图形处理器 光线跟踪 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]