期刊文献+

大规模三维模型加速渲染技术的研究与应用 被引量:5

Research and Application of Large-scale 3D Model Accelerated Rendering Technology
下载PDF
导出
摘要 随着在游戏和仿真领域中对大规模场景的要求日益提高,为了保证一般计算机在大规模三维模型的场景中仍能够较高帧率运行,基于Morton码提出了一种场景遍历算法。该算法根据满四叉树节点编码思想对线性四叉树的Morton码进行了改进,提出了一种线性多段结构,并且结合了自底向上合并的BVH来减少遍历节点,最后利用视锥体对场景内的物体进行快速裁剪。该算法结合场景中的多层均匀网格,利用CPU的多核并行计算能力,根据上层遍历结果,快速得到下层输入,能够快速对场景中的物体进行可见性裁剪,提高计算机在大规模模型场景的渲染帧率。实验结果表明了该算法的正确性和可行性,与传统的加速结构相比,帧率有了明显的提升。 With the increasing requirements for large-scale scenes in the field of games and simulation and in order to ensure that the general computer can still run at a higher frame rate in the scene of a large-scale three-dimensional model,we propose a scene traversal algorithm based on Morton Code.It is based on the idea of full quadtree node encoding for improving the Morton Code of linear quadtree,and a linear multi-segment structure is proposed.It is also combined with bottom-up BVH to reduce traversal nodes,and finally the frustum is used to quickly crop the objects in the scene.This algorithm combines the multi-layer uniform grid in the scene,uses the CPU’s multi-core parallel computing capabilities,and quickly obtains the lower-layer input according to the upper-layer traversal results.It can quickly cut the visibility of the objects in the scene and improve the computer’s large-scale model scene rendering frame rate.Experimental results show the correctness and feasibility of the algorithm.Compared with the traditional acceleration structure,its frame rate has been significantly improved.
作者 刘一明 何晓曦 黄世贤 LIU Yiming;HE Xiaoxi;HUANG Shixian(College of Software Engineering,Chengdu University of Information Technology,Chengdu 610225,China)
出处 《成都信息工程大学学报》 2021年第3期300-304,共5页 Journal of Chengdu University of Information Technology
关键词 大规模场景 加速结构 Morton码 四叉树 BVH large-scale scene acceleration structure Morton code quadtree BVH
  • 相关文献

参考文献4

二级参考文献68

  • 1熊邦书,何明一,俞华璟.三维散乱数据的k个最近邻域快速搜索算法[J].计算机辅助设计与图形学学报,2004,16(7):909-912. 被引量:65
  • 2马登武,叶文,李瑛.基于包围盒的碰撞检测算法综述[J].系统仿真学报,2006,18(4):1058-1061. 被引量:111
  • 3吴丽娟,郑冕,张彩明.海量空间数据点k近邻的快速搜索算法[J].小型微型计算机系统,2007,28(1):70-74. 被引量:7
  • 4XU Y Q,et al.Processing κ nearest neighbor queries in location-aware sensor networks[J].Signal Processing,2007.87(12):2861-2881.
  • 5WAN Y R.An efficient O(1)time 3D all nearest neighbor algorithm from image processing perspective[J].Journal of Parallel and Distil-buted Computing,2007,67(10):1082-1091.
  • 6SPROULL R F.Refinements to nearest neighbor searching in κ-dimensional trees[J].Algorithmic,1991,15(6):579-599.
  • 7INGO W, THIAGO I, ANDREW K, et al. Ray tracing animated scenes using coherent grid traversal [J]. ACM Transactions on Graphics, 2006, 25(3): 485-493.
  • 8HAVRAN V. Heuristic ray shooting algorithms [D]. Prague: Czech Technical University, 2001.
  • 9JEFFREY J. Automatic creation of object hierarchies for ray tracing [J]. IEEE Computer Graphics and Applications, 1987, 7(5): 14-20.
  • 10DAN G, SHUHONG C. Front-to-back display of bsp trees [J]. IEEE Computer Graphics and Applications, 1991, 11(5):79-85.

共引文献22

同被引文献56

引证文献5

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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