首页 | 官方网站   微博 | 高级检索  
     

一个新的线索KD树并行算法
引用本文:焦良葆,陈瑞,张健.一个新的线索KD树并行算法[J].工程图学学报,2011(5):46-50.
作者姓名:焦良葆  陈瑞  张健
作者单位:南京工程学院通信工程学院,江苏南京,211167
基金项目:江苏省自然科学基金,西门子中国研究院资助项目
摘    要:KD树是三维场景渲染中常用的空间加速算法。由于SIMD计算平台不支持递归操作,导致KD树在GPU上的应用受到限制,因此提出了一个新的基于SIMD架构的并行KD树算法。通过创建时对KD树线索化,不仅省去堆栈使用,且因无需回溯到根节点而减少大量无效遍历操作,实现了基于GPU的高效并行加速。实验结果表明,线索KD树算法每秒计算的光线数与传统算法相比,提高3~8倍不等,最终显著提高光线跟踪渲染速度。

关 键 词:三维场景渲染  线索KD树  并行算法  SIMD平台

A Novel Algorithm of Clued KD-tree on SIMD Architecture
RAO Liang-bao,CHEN Rui,ZHANG Jian.A Novel Algorithm of Clued KD-tree on SIMD Architecture[J].Journal of Engineering Graphics,2011(5):46-50.
Authors:RAO Liang-bao  CHEN Rui  ZHANG Jian
Affiliation:(School of Communication,Nanjing Institute of Technology,Nanjing Jiangsu 211167,China)
Abstract:KD-tree is a traditional accelerating algorithm in 3D scene rendering,and its parallel processing performance is restricted to the unsupported recursion operations on SIMD architecture.A novel parallel algorithm is proposed to speed up KD-tree traversal on GPU.Clues pointing to six-direction subsequent nodes are inserted into the KD-tree structure.Thus,the algorithm efficiency is improved by avoiding stack data structure and reducing the worthless operations.The experiment results verify that the clued KD-tree algorithm increases the rendering speed by 3 to 8 times than the traditional algorithms.
Keywords:3D scene rendering  clued KD-tree  parallel algorithm  single instruction multiple data platform
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号