首页> 外国专利> Start node determination for tree traversal in raytracing applications

Start node determination for tree traversal in raytracing applications

机译:在光线跟踪应用程序中开始确定树遍历的节点

摘要

At least one processor may organize a plurality of primitives within the hierarchical data structure. At least one processor may rasterize a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure into an off-screen rendering target. At least one processor may determine a bounding volume at which the rays intersect from a plurality of bounding volumes. At least one processor may determine a non-root node of the hierarchical data structure associated with the bounding volume as a starting node in the hierarchical data structure for initiating traversal of the hierarchical data structure. At least one processor may traverse the hierarchical data structure starting from the start node to determine the primitives that the rays intersect.
机译:至少一个处理器可以在分层数据结构内组织多个基元。至少一个处理器可以将与分层数据结构的非根节点相关联的多个边界体光栅化为屏幕外渲染目标。至少一个处理器可以从多个边界体积确定射线相交的边界体积。至少一个处理器可以将与边界体积相关联的分层数据结构的非根节点确定为分层数据结构中的起始节点,以用于开始遍历该分层数据结构。至少一个处理器可以从起始节点开始遍历分层数据结构,以确定光线相交的图元。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号