# US 2025/0095274 A1 · Pruning Ray Tracing Traversal Operations based on Local Ray Parameter Value

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

- Number: US 2025/0095274 A1
- Document ID: US20250095274A1
- Status: Published application
- Kind: A1
- Application number: 18/524,265
- Filed: 2023-11-30
- Published: 2025-03-20
- Earliest claimed: 2023-09-20
- Assignees: Apple Inc.
- Applicants: Apple Inc.
- Inventors: Ali Rabbani Rankouhi; Luca O. Iuliano; David J. Bermingham; Christopher A. Burns
- Web page: https://patentgrep.com/patent/US20250095274A1

## CPC

- G06T 15/06: Ray-tracing
- G06T 1/20: Processor architectures; Processor configuration, e.g. pipelining
- G06T 17/005: {Tree description, e.g. octree, quadtree}
- G06T 2210/21: Collision detection, intersection
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Techniques are disclosed relating to graphics processors that support ray tracing. In disclosed embodiments, ray intersect circuitry is configured to access a traversal stack used for traversal of multiple levels of a bounding volume hierarchy (BVH) acceleration data structure (ADS) according to a depth-first search to retrieve: coordinates of a first bounding region for a child node and a local ray parameter value that indicates a point along a ray at which an intersection with a second bounding region for the child node's parent node was detected. The accelerator circuitry may compare the local ray parameter value with an end ray parameter value to determine whether to traverse to the child node as part of traversal of the BVH.

## Claims

### Claim 1

An apparatus, comprising:
ray intersect accelerator circuitry configured to:
access a traversal stack that stores data for traversal of multiple levels of a bounding volume hierarchy (BVH) acceleration data structure (ADS) according to a depth-first search to retrieve:
coordinates of a first bounding region for a child node; and
a local ray parameter value that indicates a point along a ray at which an intersection with a second bounding region for the child node's parent node was detected; and
compare the local ray parameter value with an end ray parameter value to determine whether to traverse to the child node as part of traversal of the ADS.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the ray intersect accelerator circuitry is further configured to:
generate the local ray parameter value based on a determined entry intersection point between the ray and the second bounding region; and
write the coordinates and the local ray parameter value to the traversal stack in response to detecting intersections for multiple child nodes of the parent node.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the ray intersect accelerator circuitry is configured not to traverse to the node corresponding to the child node in response to the local ray parameter value being greater than the end ray parameter value.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the apparatus is configured to, prior to accessing the traversal stack:
perform one or more primitive tests based on traversal past a sibling node of the child node; and
update the end ray parameter value based on the one or more primitive tests.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein:
the ADS includes transform nodes, including the child node;
the apparatus is configured to transform ray coordinates in conjunction with traversing to transform nodes; and
the apparatus is configured, in response to determining not to traverse to the child node, not to transform ray coordinates for the child node.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein:
the ADS includes transform nodes;
the apparatus is configured to transform ray coordinates in conjunction with traversing to transform nodes; and
the ray intersect accelerator circuitry is configured to perform the comparison of the local ray parameter value with an end ray parameter value to determine whether to traverse to transform nodes and configured not to perform the comparison for non-transform nodes.

### Claim 7 (depends on 1)

The apparatus of claim 1, wherein:
the ray intersect accelerator circuitry is configured to generate the local ray parameter value based on an intermediate value that is computed as part of a bounding region intersection test; and
the local ray parameter value is encoded using a smaller number of bits than coordinates of the ray.

### Claim 8 (depends on 1)

The apparatus of claim 1, further comprising:
storage circuitry configured to store the coordinates of the ray and a current end ray parameter value for the ray.

### Claim 9 (depends on 1)

The apparatus of claim 1, wherein the apparatus is a computing device that further comprises:
a display;
a central processing unit; and
a network interface.

### Claim 10

A method, comprising:
accessing, by a computing system, a traversal stack that stores data for traversal of multiple levels of a bounding volume hierarchy (BVH) acceleration data structure (ADS) according to a depth-first search to retrieve:
coordinates of a first bounding region for a child node; and
a local ray parameter value that indicates a point along a ray at which an intersection with a second bounding region for an ancestor node of child node was detected;
comparing, by the computing system, the local ray parameter value with an end ray parameter value to determine whether to traverse to the child node as part of traversal of the ADS; and
traversing, by the computing system, the ADS based on the determination to generate intersection results for the ray.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
generating, by the computing system, the local ray parameter value based on a determined entry intersection point between the ray and the second bounding region; and
writing, the computing system, the coordinates and the local ray parameter value to the traversal stack in response to detecting intersections for multiple child nodes of the ancestor node.

### Claim 12 (depends on 10)

The method of claim 10, wherein the comparing determines that the local ray parameter value is greater than the end ray parameter value and the traversing does not traverse to the child node as part of traversal of the ADS.

### Claim 13 (depends on 10)

The method of claim 10, wherein the comparing is performed in response to determining that the child node is an instance node.

### Claim 14 (depends on 10)

The method of claim 10, wherein the local ray parameter value is encoded using a smaller number of bits than coordinates of the ray.

### Claim 15 (depends on 10)

The method of claim 10, further comprising:
storing, by the computing system in a ray data cache, the coordinates of the ray and a current end ray parameter value for the ray.

### Claim 16

A non-transitory computer-readable medium having instructions of a hardware description programming language stored thereon that, when processed by a computing system, program the computing system to generate a computer simulation model, wherein the model represents a hardware circuit that includes:
ray intersect accelerator circuitry configured to:
access a traversal stack that stores data for traversal of multiple levels of a bounding volume hierarchy (BVH) acceleration data structure (ADS) according to a depth-first search to retrieve:
coordinates of a first bounding region for a child node; and
a local ray parameter value that indicates a point along a ray at which an intersection with a second bounding region for the child node's parent node was detected; and
compare the local ray parameter value with an end ray parameter value to determine whether to traverse to the child node as part of traversal of the ADS.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the ray intersect accelerator circuitry is further configured to:
generate the local ray parameter value based on a determined entry intersection point between the ray and the second bounding region; and
write the coordinates and the local ray parameter value to the traversal stack in response to detecting intersections for multiple child nodes of the parent node.

### Claim 18 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the ray intersect accelerator circuitry is configured not to traverse to the node corresponding to the child node in response to the local ray parameter value being greater than the end ray parameter value.

### Claim 19 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the circuit is configured to, prior to accessing the traversal stack:
perform one or more primitive tests based on traversal past a sibling node of the child node; and
update the end ray parameter value based on the one or more primitive tests.

### Claim 20 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein:
the ADS includes transform nodes, including the child node;
the circuit is configured to transform ray coordinates in conjunction with traversing to transform nodes; and
the circuit is configured to, in response to determining not to traverse to the child node, avoid transforming ray coordinates for the child node.
