期刊文献+

基于稀疏体素有向无环图的光照计算加速结构 被引量:4

Illumination-Computation Acceleration Structure Based on Sparse Voxel Directed Acyclic Graph
原文传递
导出
摘要 提出了一种基于稀疏体素有向无环图(SVDAG)的光照计算加速结构。通过自下而上地合并相同节点,将稀疏体素八叉树转化为SVDAG;同时,利用给定节点的遍历路径和子掩码,消除了空间位置的多义性。针对闭合几何体,基于双层深度图算法可自适应合并位于闭合区域的节点,在保证光照计算性能的前提下,进一步减小了存储开销。提出了一种基于时域相关性的SVDAG帧间复用方法,利用动态场景的全部帧构成SVDAG加速结构整体,提高了更新速度。实验结果表明,新算法提高了三维场景的绘制效率,在面对高分辨率的动态场景时,仍能获得较高的帧速率。 An illumination-computation acceleration structure based on the sparse voxel directed acyclic graph(SVDAG)is proposed.By merging the same nodes from bottom to top,the sparse voxel octree is converted into a SVDAG,and the polysemy of spatial positions can be eliminated by using the traversal paths and the child masks of the given nodes.Aiming at the closed geometry,an algorithm based on the double depth maps can be used to merge adaptively the nodes located in the closed region,which can further reduce the storage cost while the performance of illumination computation is maintained.A inter-frame multiplex method of SVDAG based on the time correlation is proposed in which all frames of the dynamic scene are used to constitute an integral SVDAG acceleration structure,which can improve the update rate.The experimental results indicate that the rendering efficiency of threedimensional scene based on the new algorithm is enhanced.When a high resolution dynamic scene is conducted,a relatively high frame rate still can be obtained.
出处 《光学学报》 EI CAS CSCD 北大核心 2017年第8期259-272,共14页 Acta Optica Sinica
基金 吉林省自然科学基金(20130101069JC) 军内武器装备重点科研基金(KJ2012240)
关键词 光计算 光学数据处理 加速结构 有向无环图 双层深度图 帧间复用 optics in computing optical data processing acceleration structure directed acyclic graph double depth maps inter-frame multiplexing
  • 相关文献

参考文献7

二级参考文献80

  • 1吕广宪,潘懋,吴焕萍,丛威青,吴自兴.面向真三维地学建模的海量虚拟八叉树模型研究[J].北京大学学报(自然科学版),2007,43(4):496-501. 被引量:19
  • 2Stoll G, Mark W R, Djeu P, Wang R, Elhassan I. Razor: An architecture for dynamic multiresolution ray tracing. Department of Computer Sciences, University of Texas at Austin, USA: Technical Report TR-06-21, 2006
  • 3Wald I, Havran V. On building fast kd-trees for ray tracing and on doing that in O(n log n)//Proceedings of the IEEE Symposium on Interactive Ray Tracing 2006. Salt Lake City, USA, 2006:61-69
  • 4Fujimoto A, Tanaka T, Iwata K. Arts: Accelerated raytracing system. IEEE Computer Graphics and Applications, 1986, 6(4): 16-26
  • 5Amanatides J, Woo A. A fast voxel traversal algorithm for ray tracing//Proceedings of the EUROGRAPHICS 1987. Amsterdam, North-Holland, 1987:3-10
  • 6Jevans D, Wyvill B. Adaptive voxel subdivision for ray tracing//Proceedings of the Graphic Interface 1989. Toronto, Ontario, 1989:164-172
  • 7Cazals F, Drettakis G, Puech C. Filtering, clustering and hierarchy construction: A new solution for ray-tracing complex scenes. Computer Graphics Forum, 1995, 14(3): 371-382
  • 8Klimaszewski K S, Sederberg T W. Faster ray tracing using adaptive grids. IEEE Computer Graphics and Applications, 1997, 17(1): 42-51
  • 9Muller G, Fellner D W. Hybrid scene structuring with application to ray tracing//Proceedings of the International Conference on Visual Computing 1999. Goa, India, 1999:19-26
  • 10Parker S, Parker M, Livnat Y, Sloan P P, Hansen C, Shirley P. Interactive ray tracing for volume visulization. IEEE Transactions on Computer Graphics and Visulization, 1999, 5(3) : 238-250

共引文献46

同被引文献18

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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