# US 2025/0095272 A1 · Bounding Volume Hierarchy with Bounding Volumes in Prior Space corresponding to Subset of Transform Sub-Tree Bounds

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

- Number: US 2025/0095272 A1
- Document ID: US20250095272A1
- Status: Published application
- Kind: A1
- Application number: 18/405,191
- Filed: 2024-01-05
- Published: 2025-03-20
- Earliest claimed: 2023-09-20
- Assignees: Apple Inc.
- Applicants: Apple Inc.
- Inventors: Ali Rabbani Rankouhi; David J. Bermingham
- Web page: https://patentgrep.com/patent/US20250095272A1

## CPC

- G06T 15/06: Ray-tracing
- 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 ray tracing, e.g., in graphics processors. Ray tracing embodiments may utilize a bounding volume hierarchy (BVH) acceleration data structure (ADS) that includes a hierarchy of bounding volumes. A graphics processor may traverse the ADS, testing for intersections with bounding volumes, to determine which primitives to test for a given ray. Some nodes may be transform nodes (e.g., instance nodes) that correspond to a ray transform before further traversal. In disclosed embodiment, one or more levels below the transform node may be reverse transformed and included above the transform node. This may advantageously avoid a ray transform operation for rays that would not have hit in the first one or more levels of the transform sub-tree.

## Claims

### Claim 1

An apparatus, comprising:
processor circuitry configured to:
access graphics data that indicates coordinates of primitives in a graphics scene;
generate, based on the graphics data, a bounding volume hierarchy (BVH) acceleration data structure (ADS) that includes:
a transform node;
one or more ancestor nodes of the transform node that define bounding volumes in a first coordinate space; and
levels of descendent nodes of the transform node that define bounding volumes in a second coordinate space;
wherein the one or more ancestor nodes define, in the first coordinate space, one or more first bounding volumes, wherein a given volume of the one or more first bounding volumes:
is smaller than a bounding volume corresponding to the transform node; and
corresponds to one or more bounding volumes defined at one or more of the levels of the descendent nodes;
traverse the ADS, including to determine whether to traverse to the levels of descendent nodes based on whether there are any intersections between a ray and bounding volumes defined by the one or more ancestor nodes; and
determine one or more primitives to test for intersection by the ray based on the traversal.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the processor circuitry is configured to:
transform coordinates of a given ray to the second coordinate space and traverse the ADS to the transform node only in response to a determination of an intersect between the given ray and at least one of the one or more first bounding volumes; and
skip traversal of the transform node for the given ray in response to a determination that the given ray does not intersect any of the one or more first bounding volumes.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the processor circuitry includes:
execution circuitry configured to execute one or more programs to generate the ADS; and
dedicated ray intersect circuitry configured to traverse the ADS, including to test a given ray for intersection with multiple bounding volumes in parallel.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the first one or more bounding volumes include bounding volumes corresponding to multiple levels of the levels of descendant nodes.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein the first coordinate space is a world space and the second coordinate space is an instance space.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein the first one or more bounding volumes are included in an ancestor node that corresponds to the same bounding volume as the transform node.

### Claim 7 (depends on 1)

The apparatus of claim 1, wherein the processor circuitry is configured to determine a number of levels of descendent nodes having bounding volumes corresponding to the first one or more bounding volumes based on one or more characteristics of the levels of descendent nodes.

### Claim 8 (depends on 1)

The apparatus of claim 1, wherein at least a first node of the one or more ancestor nodes includes link information for traversal directly from the first node to one of the descendent nodes.

### Claim 9 (depends on 1)

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

### Claim 10

A method, comprising:
accessing, by a computing system, graphics data that indicates coordinates of primitives in a graphics scene;
generating, by the computing system based on the graphics data, a bounding volume hierarchy (BVH) acceleration data structure (ADS) that includes:
a transform node;
one or more ancestor nodes of the transform node that define bounding volumes in a first coordinate space; and
levels of descendent nodes of the transform node that define bounding volumes in a second coordinate space;
wherein the one or more ancestor nodes define, in the first coordinate space, one or more first bounding volumes, wherein a given volume of the one or more first bounding volumes:
is smaller than a bounding volume corresponding to the transform node; and
corresponds to one or more bounding volumes defined at one or more of the levels of the descendent nodes;
traversing, by the computing system, the ADS, including determining whether to traverse to the levels of descendent nodes based on whether there are any intersections between a ray and bounding volumes defined by the one or more ancestor nodes; and
determining one or more primitives to test for intersection by the ray based on the traversal.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
skipping, by the computing system, traversal of the transform node for a second ray in response to a determination that the second ray does not intersect any of the one or more first bounding volumes.

### Claim 12 (depends on 10)

The method of claim 10, wherein the one or more first bounding volumes include bounding volumes corresponding to multiple levels of the levels of descendant nodes.

### Claim 13 (depends on 10)

The method of claim 10, wherein the first coordinate space is a first instance space and the second coordinate space is a second instance space.

### Claim 14 (depends on 10)

The method of claim 10, wherein the one or more bounding first volumes are included in an ancestor node that corresponds to the same bounding volume as the transform node.

### Claim 15

A non-transitory computer-readable medium having instructions stored thereon that are executable by a computing device to perform operations comprising:
accessing, by a computing system, graphics data that indicates coordinates of primitives in a graphics scene;
generating, by the computing system based on the graphics data, a bounding volume hierarchy (BVH) acceleration data structure (ADS) that includes:
a transform node;
one or more ancestor nodes of the transform node that define bounding volumes in a first coordinate space; and
levels of descendent nodes of the transform node that define bounding volumes in a second coordinate space;
wherein the one or more ancestor nodes define, in the first coordinate space, one or more first bounding volumes, wherein a given volume of the one or more first bounding volumes:
is smaller than a bounding volume corresponding to the transform node; and
corresponds to one or more bounding volumes defined at one or more of the levels of the descendent nodes;
traversing, by the computing system, the ADS, including determining whether to traverse to the levels of descendent nodes based on whether there are any intersections between a ray and bounding volumes defined by the one or more ancestor nodes; and
determining one or more primitives to test for intersection by the ray based on the traversal.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the operations further comprise:
skipping traversal of the transform node for a second ray in response to a determination that the second ray does not intersect any of the one or more bounding first volumes.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the one or more first bounding volumes include bounding volumes corresponding to multiple levels of the levels of descendant nodes.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the first coordinate space is a first instance space and the second coordinate space is a second instance space.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the one or more first bounding volumes are included in an ancestor node that corresponds to the same bounding volume as the transform node.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the operations further comprise:
determining a number of levels of descendent nodes having bounding volumes corresponding to the one or more first bounding volumes based on one or more characteristics of the levels of descendent nodes.
