# US 2026/0073618 A1 · Hardware Acceleration for Motion Blur with Ray Tracing

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

- Number: US 2026/0073618 A1
- Document ID: US20260073618A1
- Status: Published application
- Kind: A1
- Application number: 19/325,111
- Filed: 2025-09-10
- Published: 2026-03-12
- Earliest claimed: 2023-12-12
- Assignees: Apple Inc.
- Applicants: Apple Inc.
- Inventors: Christopher A. Burns
- Web page: https://patentgrep.com/patent/US20260073618A1

## CPC

- G06T 15/06: Ray-tracing
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Techniques are disclosed relating to ray tracing and motion blur in graphics processors. In some embodiments, ray intersection accelerator circuitry is configured to perform traversal operations for an acceleration data structure (ADS) that includes hierarchical bounding volumes, where the ADS includes a first node that specifies: first coordinates of a bounding volume at a first motion blur time and second coordinates of the bounding volume at a second motion blur time. The Ray accelerator may determine a ray time interval representation indicating upper and lower bounds that represent error bounds for a quantized ray time value of a ray. Interpolation circuitry may operate on the first coordinates, the second coordinates, and the ray time interval representation to generate interpolated coordinates for the bounding volume. Box test circuitry may determine whether the ray intersected the bounding volume based on the interpolated coordinates and coordinates of the ray.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

An apparatus, comprising:
ray intersection accelerator circuitry configured to:
determine a quantized ray time value for a ray; and
perform traversal operations for an acceleration data structure (ADS) that includes hierarchical bounding volumes, wherein the ADS includes a first node that specifies:
first coordinates of a bounding volume at a first motion blur time; and
second coordinates of the bounding volume at a second motion blur time;
wherein the ray intersection accelerator circuitry includes:
interpolation circuitry configured to operate on the first coordinates, the second coordinates, and the quantized ray time value to generate interpolated coordinates for the bounding volume; and
box test circuitry configured to determine whether the ray intersected the bounding volume based on the interpolated coordinates and coordinates of the ray.

### Claim 22 (depends on 21)

The apparatus of claim 21, wherein the box test circuitry is configured to perform slab tests and the interpolated coordinates indicate multiple interpolated slabs.

### Claim 23 (depends on 22)

The apparatus of claim 22, wherein the interpolation circuitry includes multiple slab interpolators configured to generate interpolated slab coordinates for the multiple slabs in parallel.

### Claim 24 (depends on 23)

The apparatus of claim 23, wherein the interpolation circuitry includes at most two multipliers configured to generate a given interpolated slab of the multiple slabs.

### Claim 25 (depends on 21)

The apparatus of claim 21, wherein:
the first and second coordinates of the bounding volume are quantized and represented using a first number of bits; and
the quantized ray time value is represented using at least one more bit than the first number of bits.

### Claim 26 (depends on 21)

The apparatus of claim 21, wherein:
the ADS includes a temporal split node at a different level in the ADS than the first node; and
the first motion blur time and the second motion blur time cover a proper sub-interval of an longer motion blur interval corresponding to the temporal split node.

### Claim 27 (depends on 21)

The apparatus of claim 21, wherein:
the ray intersection accelerator circuitry is configured to determine a ray time interval representation indicating upper and lower bounds that represent error bounds corresponding to quantization of a ray time;
the quantized ray time value corresponds to one of the upper and lower bounds; and
the interpolation circuitry is configured to operate on the upper and lower bounds to generate the interpolated coordinates for the bounding volume.

### Claim 28 (depends on 27)

The apparatus of claim 27, wherein:
the ray intersection accelerator circuitry is configured to store a first bound of upper and lower bounds; and
the interpolation circuitry is configured to imply a second bound of the ray time interval representation based on the stored first bound.

### Claim 29 (depends on 21)

The apparatus of claim 21, wherein:
the first node includes an indication that the first node is a spacetime node; and
the ADS includes a second node that includes an indication the second node is a spatial node that does not include coordinates for its bounding volumes at different times.

### Claim 30 (depends on 29)

The apparatus of claim 29, wherein the ADS encodes bounding volumes for a larger number of nodes in spatial nodes than in spacetime nodes.

### Claim 31 (depends on 29)

The apparatus of claim 29, further comprising:
clock gate circuitry configured to clock gate an unused portion of the box test circuitry when operating on a spacetime node.

### Claim 32

A method, comprising:
determine, by a computing system, a quantized ray time interval for a ray; and
performing, by the computing system, traversal operations for an acceleration data structure (ADS) that includes hierarchical bounding volumes, wherein the ADS includes a first node that specifies:
first coordinates of a bounding volume at a first motion blur time; and
second coordinates of the bounding volume at a second motion blur time;
operating, by the computing system, on the first coordinates, the second coordinates, and the quantized ray time interval to generate interpolated coordinates for the bounding volume; and
determining, by the computing system, whether the ray intersected the bounding volume based on the interpolated coordinates and coordinates of the ray.

### Claim 33 (depends on 32)

The method of claim 32, wherein:
the determining the ray time interval representation and the performing are performed by ray intersect accelerator circuitry of the computing system;
the operating is performed by interpolation circuitry of the computing system; and
the determining whether the ray intersected the bounding volume is performed by box test circuitry of the computing system.

### Claim 34 (depends on 32)

The method of claim 32, wherein:
the first node includes an indication that the first node is a spacetime node; and
the ADS includes a second node that includes an indication the second node is a spatial node that does not include coordinates for its bounding volumes at different times.

### Claim 35 (depends on 34)

The method of claim 34, wherein the ADS encodes bounding volumes for a larger number of child nodes in spatial nodes than in spacetime nodes.

### Claim 36 (depends on 35)

The method of claim 35, further comprising:
clock gating, by the computing system, when operating on a spacetime node, an unused portion of box test circuitry that performs the determining.

### Claim 37

A method, comprising:
generating, by a computing system, an acceleration data structure (ADS) that includes hierarchical bounding volumes for a graphics scene;
wherein:
the ADS includes a first node that is a spacetime node and a second node that is a spatial node;
the spacetime node includes:
first coordinates of a first bounding volume at a first motion blur time; and
second coordinates of the first bounding volume at a second motion blur time;
the spatial node includes coordinates of a second bounding volume for a single point in time;
the first node includes an indication that the first node is a spacetime node; and
the second node includes an indication the second node is a spatial node that does not include coordinates for its bounding volumes at different times.

### Claim 38 (depends on 37)

The method of claim 37, wherein the ADS encodes bounding volumes for a larger number of child nodes in spatial nodes than in spacetime nodes.

### Claim 39 (depends on 37)

The method of claim 37, wherein the first node includes quantization frame information associated with quantization of the bounding volume.

### Claim 40 (depends on 37)

The method of claim 37, wherein the first motion blur time and the second motion blur time cover a proper sub-interval of a longer motion blur interval, due to a temporal split node that is at a different level in the ADS than the first node.
