期刊文献+

基于CUDA的光线追踪优化算法研究与实现 被引量:4

ON CUDA-BASED OPTIMISED RAY TRACING ALGORITHM AND ITS REALISATION
下载PDF
导出
摘要 在三维场景仿真过程中,为了实现真实的光影效果,通常采用光线追踪法对场景进行渲染。光线追踪算法的核心过程是光线与场景中的片元进行相交测试,而对于一个复杂的场景,该过程计算量非常大。为了改善光线追踪算法的计算速度问题,实现一种基于CUDA(Compute Unified Device Architecture)的光线追踪算法。该算法利用GPU的并行处理能力同时结合KD-Tree加速相交测试过程,最终提高仿真场景的渲染速度。通过实验表明,该算法的KD-Tree创建性能相比传统方法提升约20%,光线追踪性能提升约6倍。 In three-dimensional scene simulation process, in order to achieve realistic lighting effects, ray tracing method is usually used to render the scene. The intersection test of the light and the render-element is the core process of ray tracing algorithm, and for a complex scene, the process is highly computational. We implement a ray tracing algorithm which is based on CUDA (Compute Unified Device Architecture). The algorithm makes use of GPU's parallel processing capability, and combines with KD-Tree to accelerate the intersection testing process at the same time. It is demonstrated through experiment that our algorithm improves the KD-Tree creation performance about 20% compared with traditional method, and the ray tracing performance is also improved about 6 times.
出处 《计算机应用与软件》 CSCD 2015年第1期161-162,198,共3页 Computer Applications and Software
关键词 光线追踪 KD树 CUDA GPU Ray tracing KD-tree CUDA GPU
  • 相关文献

参考文献9

  • 1Nvidia.Nvidia Cuda C Programming Guide(Version 4.0)[R].2011.
  • 2Nvidia.Nvidia Cuda C Best Practices Guide(Version 4.0)[R].2011.
  • 3Jason Sanders,Edward Kandrot.CUDA By Example an introduction to General-Purpose GPU Programming[M].北京:机械工业出版社,2011.
  • 4David B.Kirk,Wen-mei W.Hwu.Programming Massively Parallel Processing[M].北京:清华大学出版社,2010.
  • 5Gunther J,Popov S,Seidel H.Real time ray tracing on GPU with BVH-based packet traversal[C]//Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing,2007:113-118.
  • 6Woop S,Schmittler J,Slusallet P.A programmable ray processing unit for real time Ray Tracing[J].ACM Trans on Graphics,2005,24(3):434-444.
  • 7Reshetov A,Soupikov A,Hurley J.Multi-level ray tracing algorithm[J].ACM Trans on Graphics,2005,24(3):1176-1185.
  • 8Havran V,Bittner J.On improving KD tree for ray shooting[C]//Proceedings of WSCG,2002:209-216.
  • 9Kanungo Tapas,Mount D M.An efficient k-means clustering algorithm:analysis and implementation[J].Pattern Analysis and Machine Intelligence,2002,24(7):881-892.

同被引文献26

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部