检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘一明 何晓曦[1] 黄世贤 LIU Yiming;HE Xiaoxi;HUANG Shixian(College of Software Engineering,Chengdu University of Information Technology,Chengdu 610225,China)
机构地区:[1]成都信息工程大学软件工程学院,四川成都610225
出 处:《成都信息工程大学学报》2021年第3期300-304,共5页Journal of Chengdu University of Information Technology
摘 要:随着在游戏和仿真领域中对大规模场景的要求日益提高,为了保证一般计算机在大规模三维模型的场景中仍能够较高帧率运行,基于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.
关 键 词:大规模场景 加速结构 Morton码 四叉树 BVH
分 类 号:TP312[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249