Invention Grant
- Patent Title: Relative encoding for a block-based bounding volume hierarchy
- Patent Title (中): 基于块的边界卷分层的相对编码
-
Application No.: US14589910Application Date: 2015-01-05
-
Publication No.: US09552664B2Publication Date: 2017-01-24
- Inventor: Samuli Matias Laine , Timo Oskari Aila , Tero Tapani Karras
- Applicant: NVIDIA Corporation
- Applicant Address: US CA Santa Clara
- Assignee: NVIDIA Corporation
- Current Assignee: NVIDIA Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Zilka-Kotab, PC
- Main IPC: G06T15/10
- IPC: G06T15/10 ; G06T17/00 ; G06T15/06

Abstract:
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.
Public/Granted literature
- US20160071313A1 RELATIVE ENCODING FOR A BLOCK-BASED BOUNDING VOLUME HIERARCHY Public/Granted day:2016-03-10
Information query
IPC分类:
G | 物理 |
G06 | 计算;推算或计数 |
G06T | 一般的图像数据处理或产生 |
G06T15/00 | 3D〔三维〕图像的加工 |
G06T15/10 | .图形效果 |