会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Relative encoding for a block-based bounding volume hierarchy
    • 基于块的边界卷分层的相对编码
    • US09552664B2
    • 2017-01-24
    • US14589910
    • 2015-01-05
    • NVIDIA Corporation
    • Samuli Matias LaineTimo Oskari AilaTero Tapani Karras
    • G06T15/10G06T17/00G06T15/06
    • G06T9/40G06T9/001G06T15/005G06T15/04G06T15/06G06T15/08G06T15/10G06T15/80G06T17/005G06T17/10
    • A system, method, and computer program product for implementing a tree traversal operation for a tree data structure is disclosed. The method includes the steps of receiving at least a portion of a tree data structure that represents a tree having a plurality of nodes and processing, via a tree traversal operation algorithm executed by a processor, one or more nodes of the tree data structure by intersecting the one or more nodes of the tree data structure with a query data structure. A first node of the tree data structure is associated with a first local coordinate system and a second node of the tree data structure is associated with a second local coordinate system, the first node being an ancestor of the second node, and the first local coordinate system and the second local coordinate system are both specified relative to a global coordinate system.
    • 公开了一种用于实现树数据结构的树遍历操作的系统,方法和计算机程序产品。 该方法包括以下步骤:接收表示具有多个节点的树的树数据结构的至少一部分,并且经由处理器执行的树遍历运算算法,通过相交来处理树数据结构的一个或多个节点 具有查询数据结构的树数据结构的一个或多个节点。 树数据结构的第一节点与第一局部坐标系相关联,并且树数据结构的第二节点与第二局部坐标系相关联,第一节点是第二节点的祖先,第一局部坐标 系统和第二局部坐标系均相对于全局坐标系来指定。
    • 8. 发明申请
    • BEAM TRACING
    • 光束追踪
    • US20160071310A1
    • 2016-03-10
    • US14662090
    • 2015-03-18
    • NVIDIA Corporation
    • Tero Tapani KarrasTimo Oskari AilaSamuli Matias LaineJohn Erik Lindholm
    • G06T15/06G06T15/80G06T15/00
    • G06F17/30961G06F17/30327G06F17/30563G06T1/60G06T9/40G06T15/005G06T15/06G06T15/08G06T15/10G06T15/80G06T17/10H04N19/174H04N19/44
    • An apparatus, computer readable medium, and method are disclosed for performing an intersection query between a query beam and a target bounding volume. The target bounding volume may comprise an axis-aligned bounding box (AABB) associated with a bounding volume hierarchy (BVH) tree. An intersection query comprising beam information associated with the query beam and slab boundary information for a first dimension of a target bounding volume is received. Intersection parameter values are calculated for the first dimension based on the beam information and the slab boundary information and a slab intersection case is determined for the first dimension based on the beam information. A parametric variable range for the first dimension is assigned based on the slab intersection case and the intersection parameter values and it is determined whether the query beam intersects the target bounding volume based on at least the parametric variable range for the first dimension.
    • 公开了一种用于执行查询光束和目标界限卷之间的交叉查询的装置,计算机可读介质和方法。 目标边界体积可以包括与边界体积分层(BVH)树相关联的轴对齐边界框(AABB)。 接收包括与查询波束相关联的波束信息和用于目标边界体积的第一维度的平板边界信息的交叉点查询。 基于波束信息和平板边界信息,针对第一维度计算交点参数值,并且基于波束信息为第一维度确定板交集情况。 基于板交集案例和交集参数值分配第一维度的参数变量范围,并且基于至少第一维度的参数可变范围确定查询梁是否与目标界限卷相交。