# US 2022/0044467 A1 · Temporal data structures in a ray tracing architecture

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0044467 A1
- Document ID: US20220044467A1
- Status: Published application
- Kind: A1
- Application number: 17/373,993
- Filed: 2021-07-13
- Published: 2022-02-10
- Earliest claimed: 2017-04-01
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Sven WOOP; Attila AFRA; Carsten BENTHIN; Ingo WALD; Johannes GUENTHER
- Web page: https://patentgrep.com/patent/US20220044467A1

## CPC

- G06T 15/005: {General purpose rendering architectures}
- G06T 1/20: Processor architectures; Processor configuration, e.g. pipelining
- G06T 15/06: Ray-tracing
- G06T 17/00: Three-dimensional [3D] modelling for computer graphics
- G09G 2360/00: Aspects of the architecture of display systems
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G09G: ARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION (arrangements for transferring data between digital computers and displays G06F3/14; static indicating arrangements comprising an association of a number of separate sources or light control cells G09F9/00; static indicating arrangements comprising integral associations of a number of light sources H01J, H01K, H10H, H05B33/12; scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission, details thereof H04N1/00)

## 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.

## Claims

### Claim 1

A graphics processor comprising:
a memory interconnect to couple to a local memory device, the local memory device to store executable graphics commands and data; and
graphics processing hardware logic comprising a plurality of cores, at least one of the cores to execute the graphics commands and render images based on a plurality of rays traversed through a bounding volume hierarchy (BVH), the BVH comprising a plurality of hierarchically-arranged nodes constructed based on a plurality of input primitives, each node including multi-dimensional spatial components and at least one node also including temporal components;
ray tracing hardware logic of at least one of the cores to accelerate ray tracing operations, the ray tracing hardware logic comprising:
motion blur processing hardware logic to perform an interpolation based on positions of an input primitive of the plurality of input primitives within the multi-dimensional spatial components over a time defined by temporal components of the at least one node, and
ray traversal/intersection hardware logic to traverse a ray of the plurality of rays through the BVH and to determine an intersection between the ray and the input primitive based on the interpolation and a timestamp associated with the ray.

### Claim 2 (depends on 1)

The graphics processor of claim 1 further comprising:
BVH construction circuitry to generate at least a portion of the BVH based on the plurality of input primitives.

### Claim 3 (depends on 2)

The graphics processor of claim 2 wherein the temporal components comprise temporal bounds indicated by a first timestamp and a second timestamp.

### Claim 4 (depends on 3)

The graphics processor of claim 3 wherein the ray is tested for intersection with the input primitive only if the timestamp associated with the ray is bounded by the first timestamp and the second timestamp.

### Claim 5 (depends on 1)

The graphics processor of claim 1 wherein the interpolation comprises a linear interpolation.

### Claim 6 (depends on 1)

The graphics processor of claim 1 wherein each ray of the plurality of rays is associated with a timestamp.

### Claim 7 (depends on 1)

The graphics processor of claim 1 wherein each ray of the plurality of rays is associated with a group of rays and wherein a timestamp is associated with all rays in the group of rays.

### Claim 8 (depends on 2)

The graphics processor of claim 2 wherein the BVH construction circuitry is to further perform a temporal analysis related to the plurality of input primitives and responsively generate the BVH comprising nodes with spatial, temporal, and spatial-temporal components that are hierarchically arranged.

### Claim 9 (depends on 2)

The graphics processor of claim 2 wherein the spatial components include a plurality of spatial nodes with children, the spatial nodes bounding their children using spatial components.

### Claim 10 (depends on 9)

The graphics processor of claim 9 wherein the temporal components comprise minimum and maximum time values.

### Claim 11 (depends on 10)

The graphics processor of claim 10 wherein the BVH construction circuitry is to select a spatial or temporal split that minimizes a motion blur surface area heuristic, and wherein the motion blur surface area heuristic is to estimate a probability of hitting a list of input primitives bounded by spatial and temporal components through a product of a size of a difference between the minimum and maximum time values and surface area of the spatial components, and to estimate a size of a set of input primitives by a sum of a number of time segments of all input primitives of the set of input primitives.

### Claim 12 (depends on 1)

The graphics processor of claim 1 wherein the input primitives comprise triangles.

### Claim 13

A method comprising:
storing executable graphics commands and data in a local memory device;
executing, by at least one core of graphics processing hardware logic comprising a plurality of cores, graphics commands and rendering images based on a plurality of rays traversed through a bounding volume hierarchy (BVH), the BVH comprising a plurality of hierarchically-arranged nodes constructed based on a plurality of input primitives, each node including multi-dimensional spatial components and at least one node also including temporal components;
performing an interpolation based on positions of an input primitive of the plurality of input primitives within the multi-dimensional spatial components over a time defined by temporal components of the at least one node; and
traversing a ray of the plurality of rays through the BVH and to determine an intersection between the ray and the input primitive based on the interpolation and a timestamp associated with the ray.

### Claim 14 (depends on 1)

The method of claim 1 further comprising:
generating at least a portion of the BVH based on the plurality of input primitives.

### Claim 15 (depends on 14)

The method of claim 14 wherein the temporal components comprise temporal bounds indicated by a first timestamp and a second timestamp.

### Claim 16 (depends on 15)

The method of claim 15 wherein the ray is tested for intersection with the input primitive only if the timestamp associated with the ray is bounded by the first timestamp and the second timestamp.

### Claim 17 (depends on 13)

The method of claim 13 wherein the interpolation comprises a linear interpolation.

### Claim 18 (depends on 13)

The method of claim 13 wherein each ray of the plurality of rays is associated with a timestamp.

### Claim 19 (depends on 13)

The method of claim 13 wherein each ray of the plurality of rays is associated with a group of rays and wherein a timestamp is associated with all rays in the group of rays.

### Claim 20 (depends on 14)

The method of claim 14 further comprising:
performing a temporal analysis related to the plurality of input primitives and responsively generating the BVH comprising nodes with spatial, temporal, and spatial-temporal components that are hierarchically arranged.

### Claim 21 (depends on 14)

The method of claim 14 wherein the spatial components include a plurality of spatial nodes with children, the spatial nodes bounding their children using spatial components.

### Claim 22 (depends on 21)

The method of claim 21 wherein the temporal components comprise minimum and maximum time values.

### Claim 23 (depends on 22)

The method of claim 22 further comprising:
selecting a spatial or temporal split that minimizes a motion blur surface area heuristic, and wherein the motion blur surface area heuristic is to estimate a probability of hitting a list of input primitives bounded by spatial and temporal components through a product of a size of a difference between the minimum and maximum time values and surface area of the spatial components, and
estimating a size of a set of input primitives by a sum of a number of time segments of all input primitives of the set of input primitives.

### Claim 24

A machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform the operations of:
storing executable graphics commands and data in a local memory device;
executing, by at least one core of graphics processing hardware logic comprising a plurality of cores, graphics commands and rendering images based on a plurality of rays traversed through a bounding volume hierarchy (BVH), the BVH comprising a plurality of hierarchically-arranged nodes constructed based on a plurality of input primitives, each node including multi-dimensional spatial components and at least one node also including temporal components;
performing an interpolation based on positions of an input primitive of the plurality of input primitives within the multi-dimensional spatial components over a time defined by temporal components of the at least one node; and
traversing a ray of the plurality of rays through the BVH and to determine an intersection between the ray and the input primitive based on the interpolation and a timestamp associated with the ray.

### Claim 25 (depends on 24)

The machine-readable medium of claim 24 further comprising program code to cause the machine to perform the operations of:
generating at least a portion of the BVH based on the plurality of input primitives.

### Claim 26 (depends on 25)

The machine-readable medium of claim 25 wherein the temporal components comprise temporal bounds indicated by a first timestamp and a second timestamp.

### Claim 27 (depends on 26)

The machine-readable medium of claim 26 wherein the ray is tested for intersection with the input primitive only if the timestamp associated with the ray is bounded by the first timestamp and the second timestamp.

### Claim 28 (depends on 24)

The machine-readable medium of claim 24 wherein the interpolation comprises a linear interpolation.

### Claim 29 (depends on 24)

The machine-readable medium of claim 24 wherein each ray of the plurality of rays is associated with a timestamp.

### Claim 30 (depends on 24)

The machine-readable medium of claim 24 wherein each ray of the plurality of rays is associated with a group of rays and wherein a timestamp is associated with all rays in the group of rays.

### Claim 31 (depends on 25)

The machine-readable medium of claim 25 further comprising program code to cause the machine to perform the operations of:
performing a temporal analysis related to the plurality of input primitives and responsively generating the BVH comprising nodes with spatial, temporal, and spatial-temporal components that are hierarchically arranged.

### Claim 32 (depends on 25)

The machine-readable medium of claim 25 wherein the spatial components include a plurality of spatial nodes with children, the spatial nodes bounding their children using spatial components.

### Claim 33 (depends on 32)

The machine-readable medium of claim 32 wherein the temporal components comprise minimum and maximum time values.

### Claim 34 (depends on 33)

The machine-readable medium of claim 33 further comprising program code to cause the machine to perform the operations of:
selecting a spatial or temporal split that minimizes a motion blur surface area heuristic, and wherein the motion blur surface area heuristic is to estimate a probability of hitting a list of input primitives bounded by spatial and temporal components through a product of a size of a difference between the minimum and maximum time values and surface area of the spatial components, and
estimating a size of a set of input primitives by a sum of a number of time segments of all input primitives of the set of input primitives.
