期刊文献+

基于OpenCL的实时KD-Tree与动态场景光线跟踪 被引量:7

OpenCL-Based Real-Time KD-Tree and Raytracing for Dynamic Scene
在线阅读 下载PDF
导出
摘要 目前,基于GPU或多核CPU加速的光线跟踪算法是与硬件相关的.研究具有跨平台性能的实时光线跟踪算法既具有挑战性,又具有很强的应用价值.为此,提出一种基于OpenCL并且跨平台的动态场景实时光线跟踪绘制算法.首先通过对通用GPU并行处理性能进行发掘,将光线跟踪中KD-Tree建立、场景遍历和绘制3个过程均设计在GPU上,而CPU只负责其中各过程的调度,从而充分利用了GPU的计算性能,并有效地降低了数据传输开销;通过设计并行分区、并行SAH、紧密的数据管理以及区间性叶结点存储等算法,在GPU中高效、高质量地建立动态场景的KD-Tree,同时高质量的KD-Tree也有效地加速了场景的遍历速度.该算法以广度优先和大规模并行模式建立KD-Tree,更具通用性,既可以运行于NVIDIA GPU(CUDA GPU),也可以运行于AMD GPU.实验结果表明,文中算法可以在NVIDIA GPU和AMD GPU上对中等规模的动态场景实现实时光线跟踪绘制. Due to acceleration algorithms of ray-tracing only designed for specified GPU or multi-core CPU, it is challenge to design a cross platform ray-tracing algorithm for real-time applications. This paper presents a cross-platform algorithm of ray-tracing dynamic scenes based on OpenCL. By exploiting parallel processing ability of general purpose GPU, three components of ray-tracing, i. e. , KD-Tree construction, scene traversal and shading, are performed on GPU, which are scheduled by CPU. Thus GPU computing ability is exploited thoroughly and data transmission overhead is reduced efficiently. By designing algorithms of parallel partitions and SAH, proposing strategies of compact data management and offset mark based leaf node storage, a high quality KD-Tree for dynamic scene is constructed on GPU in real-time, which will effectively facilitates scene traversal. The tree construction algorithm is breadth-first and suitable for large scale parallel implementation on both NVIDIA GPU and AMD GPU. Experimental results show that the proposed algorithm is capable of ray-tracing a middle scale dynamic scene in real-time on both NVIDIA GPU and AMD GPU.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2013年第7期963-973,共11页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(60933007 61173128 61170138) 国家"九七三"重点基础研究发展计划项目(2009CB320800) 教育部新世纪优秀人才支持计划(NCET-10-0728)
关键词 KD—Tree 表面积启发式 GPU并行计算 OPENCL 光线跟踪 动态场景 KD-Tree surface area heuristic (SAH) GPU parallel computing OpenCL ray-tracing dynamic scene
  • 相关文献

参考文献17

  • 1Whitted T. An improved illumination model for shaded display[J].Communications of the ACM,1980,(06):343-349.
  • 2Bentley J L. Multidimensional binary search trees used for associative searching[J].Communications of the ACM,1975,(09):509-517.
  • 3Hapala M,Havran V. Review:KD-Tree traversal algorithms for ray tracing[J].Computer Graphics Forum,2011,(01):199-213.
  • 4Wald I,Günther J,Slusallek P. Balancing considered harmful-faster photon mapping using the voxel volume heuristic[J].Computer Graphics Forum,2004,(03):595-603.doi:10.1111/j.1467-8659.2004.00791.x.
  • 5Goldsmith J,Salmon J. Automatic creation of object hierarchies for ray tracing[J].IEEE Computer Graphics and Applications,1987,(05):14-20.
  • 6Slusallek P,Shirley P,Mark W. Introduction to real-time ray tracing[A].New York:acm Press,2005.ArticleNo.1.
  • 7Wald I,Havran V. On building fast KD-Trees for ray tracing,and on doing that in O(n log n)[A].Salt Lake City:Utah University Press,2006.61-69.
  • 8Shevtsov M,Soupikov A,Kapustin A. Highly parallel fast KD-Tree construction for interactive ray tracing of dynamic scenes[J].Computer Graphics Forum,2007,(03):395-404.doi:10.1111/j.1467-8659.2007.01062.x.
  • 9Purcell T J. Ray tracing on a stream processor[D].Standford:Standford University,2004.
  • 10Zhou K,Hou Q M,Wang R. Real-time KD-Tree construction on graphics hardware[J].ACM Transactions on Graphics,2008,(05):ArticleNo.126.

二级参考文献15

  • 1Reshetov A, Soupikov A, Hruley J. Multi-level ray tracing algorithm//Proeeedings of ACM SIGGRAPH2005. Los Angeles, USA, 2005:1176-1185.
  • 2Wald I, Slusallek P, Benthin C, Wagner M. Interactive rendering with coherent ray tracing. Computer Graphics Forum, 2001, 20(3) :153-164.
  • 3Wald I. Realtime ray tracing and interactive global illumination [-Ph. D. dissertation]. Saarland University, Saarbrucken, German, 2004.
  • 4Glassner A. An Introduction to Ray Tracing. San Francisco, USA: Morgan Kaufmann, 1989.
  • 5Wald I, Havran V. On building fast kd-trees for ray tracing, and on doing that in O(n logn)//Proceedings of the IEEE Symposium on Interactive Ray Tracing 2006. Salt Lake City, USA, 2006:61-69.
  • 6Lext J, Assarsson U, Moiler T. A benchmark for animated ray tracing. IEEE Computer Graphics and Application, 2001, 21(2): 22-31.
  • 7Macdonald J D, Booth K S. Heuristics for ray tracing using space subdivision. The Visual Computer, 1990, 6(3): 153- 166.
  • 8Havran V. Heuristic ray shooting algorithms[Ph. D. dissertation]. Czech Technical University, Prague, Czech Republic, 2001.
  • 9Santalo L. Integral Geometry and Geometric Probability. Cambridge, UK: Cambridge University Press, 2004.
  • 10Havran V, Bittner J. On improving kd tree for ray shooting//Proceedings of the WSCG' 2002 Conference. Plzen, Czech Republic, 2002:209-216.

共引文献8

同被引文献120

引证文献7

二级引证文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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