公开(公告)号：US20200160583A1

公开(公告)日：2020-05-21

申请号：US16749856

申请日：2020-01-22

Applicant: INTEL IP CORPORATION

Inventor： Sven WOOP ,  Attila AFRA ,  Carsten BENTHIN ,  Ingo WALD ,  Johannes GUENTHER

IPC: G06T15/00 ,  G06T1/20 ,  G06T15/06

Abstract: A graphics processing apparatus comprising bounding volume hierarchy (BVH) construction circuitry to perform a spatial analysis and temporal analysis related to a plurality of input primitives and responsively generate a BVH comprising spatial, temporal, and spatial-temporal components that are hierarchically arranged, wherein the spatial components include a plurality of spatial nodes with children, the spatial nodes bounding the children using spatial bounds, and the temporal components comprise temporal nodes with children, the temporal nodes bounding their children using temporal bounds and the spatial-temporal components comprise spatial-temporal nodes with children, the spatial-temporal nodes bounding their children using spatial and temporal bounds; and ray traversal/intersection circuitry to traverse a ray or a set of rays through the BVH in accordance with the spatial and temporal components.

公开(公告)号：US20210133915A1

公开(公告)日：2021-05-06

申请号：US17097246

申请日：2020-11-13

Applicant: INTEL IP CORPORATION

Inventor： Carsten BENTHIN ,  Sven WOOP ,  Ingo WALD

IPC: G06T1/20 ,  G06F9/38 ,  G06T17/10 ,  G06T15/06 ,  G06T15/00

Abstract: Apparatus and method for compressing an acceleration data structure such as a bounding volume hierarchy (BVH). For example, one embodiment of a graphics processing apparatus comprises: one or more cores to execute graphics instructions including instructions to perform ray tracing operations; and compression circuitry to compress lowest level nodes of a hierarchical acceleration data structure comprising a plurality of hierarchically arranged nodes, each of the lowest level nodes comprising pointers to leaf data; the compression circuitry to quantize the lowest level nodes to generate quantized lowest level nodes and to store each quantized lowest level node and associated leaf data without the pointers to the leaf data.