| 摘要: |
| 提出了一种适用于交互式动态场景光线跟踪的高质量k-D树构建算法.结合基本的k-D树遍历代价函数和场景一般具有较均匀分布的特征,推导出合理表示节点中连续分割面遍历代价的计算公式.在计算过程中将待划分节点包围盒划分成均匀子空间,采用直接求解函数解析解的方式进行节点分割面计算.为了保证各种光线跟踪应用中较高的渲染效率,提出了不同情况下合理的空间划分数量计算函数.实验结果表明,该算法适用于各种不同图元分布的场景k-D 树构建,并可以应用于整个构建过程,效率有了很大的提升,同时构建结果保持了与最优划分相近的质量. |
| 关键词: 光线跟踪 k-D树 空间划分 加速结构 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金(60903118, 60832011, 61103137) |
|
| Fast High Quality k-D Tree Construction Algorithm |
|
QIAN Yin-Ling1,2,3, LIANG Xiao2,4,5, ZHANG Yan-Ci2,6
|
|
1.State Key Laboratory of Computer Science (Institute of Software, The Chinese Academy of Sciences), Beijing 100190, China;2.College of Computer Science, Sichuan University, Chengdu 610065, China;3.State Key Laboratory of Fundamental Science on Synthetic Vision;4.College of Computer Science, Southwest Petroleum University, Chengdu 610500, China;5.State Key Laboratory of Fundamental Science on Synthetic Vision, Sichuan University, Chengdu 610065,;6.State Key Laboratory of Fundamental Science on Synthetic Vision, Sichuan University, Chengdu 610065, China
|
| Abstract: |
| This paper proposes a high quality k-D tree constructing algorithm for interactive dynamic scene ray tracing. Combined with the fact that scene primitives were usually well distributed, a reasonable formula is derived from the basic k-D tree traversal cost function to represent the traversal cost for sequential positions in node. After dividing the bounding box of splitting node to uniform bin series, the best splitting position is directly computed by resolving the analytic solution of the cost formula. To guarantee superior rendering performance for different ray tracing applications, the study raised several sensible functions for sub-space number computing in different situations. Experimental results proved that this algorithm was suitable for scenes with various kinds of primitive distribution, and it can be used for full k-D tree construction. Great construction efficiency was obtained with the best splitting quality maintained. |
| Key words: ray tracing k-D tree space splitting acceleration structure |
