# US 2026/0094343 A1 · Accelerating bounding volume hierarchy construction with machine learning

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

- Number: US 2026/0094343 A1
- Document ID: US20260094343A1
- Status: Published application
- Kind: A1
- Application number: 18/899,039
- Filed: 2024-09-27
- Published: 2026-04-02
- Earliest claimed: 2024-09-27
- Assignees: Advanced Micro Devices, Inc.
- Applicants: Advanced Micro Devices, Inc.
- Inventors: Carsten Benthin; Daniel Meister
- Web page: https://patentgrep.com/patent/US20260094343A1

## CPC

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

## Abstract

Techniques herein involve building bounding volume hierarchies for ray tracing using neural networks. Bottom-up BVH building techniques include nearest neighbor search operations and tree construction operations. The nearest neighbor search operations evaluate a set of candidate nodes that do not have any parents to identify nearest neighbor pairs and the tree construction operations “combine” the nearest neighbor pairs by generating new nodes that are parents of the nodes of the pairs. The nearest neighbor search is an expensive operation as it generally considers all possible combinations of the set to select one considered “best.” A neural network model is thus proposed herein which can perform this nearest neighbor search in a more efficient manner. Specifically, the neural network model accepts, as input, information characterizing the nodes of a set for which a search is performed and provides, as output, information characterizing the nearest neighbor pairs found for the set.

## Claims

### Claim 1

A method comprising:
identifying one or more nodes for which a nearest neighbor search is to be performed;
applying data characterizing the one or more nodes to a neural network model to obtain outputs identifying one or more nearest neighbors; and
generating a portion of a bounding volume hierarchy (“BVH”) based on the one or more nearest neighbors.

### Claim 2 (depends on 1)

The method of claim 1, wherein the identifying comprises identifying one or more nodes of the BVH that have no parent in the BVH.

### Claim 3 (depends on 1)

The method of claim 1, wherein the neural network model comprises a multi-layer perceptron.

### Claim 4 (depends on 1)

The method of claim 1, wherein the data characterizing the one or more nodes to the neural network model comprises one or more bounding volumes for the nodes.

### Claim 5 (depends on 4)

The method of claim 4, wherein the data includes maxima and minima for each axis for the bounding volumes.

### Claim 6 (depends on 5)

The method of claim 5, wherein the maxima and minima are quantized.

### Claim 7 (depends on 6)

The method of claim 6, wherein the maxima and minima are in fixed point format.

### Claim 8 (depends on 7)

The method of claim 7, wherein a number of bits in values of the fixed point format are dependent on a level in the BVH of the nodes or are based on ranges of the maxima and minima.

### Claim 9 (depends on 1)

The method of claim 1, wherein the neural network provides outputs for multiple levels of the BVH for a single set of inputs.

### Claim 10

A system comprising:
a memory configured to store a neural network model; and
a processor configured to perform operations comprising:
identifying one or more nodes for which a nearest neighbor search is to be performed;
applying data characterizing the one or more nodes to the neural network model to obtain outputs identifying one or more nearest neighbors; and
generating a portion of a bounding volume hierarchy (“BVH”) based on the one or more nearest neighbors.

### Claim 11 (depends on 10)

The system of claim 10, wherein the identifying comprises identifying one or more nodes of the BVH that have no parent in the BVH.

### Claim 12 (depends on 10)

The system of claim 10, wherein the neural network model comprises a multi-layer perceptron.

### Claim 13 (depends on 10)

The system of claim 10, wherein the data characterizing the one or more nodes to the neural network model comprises one or more bounding volumes for the nodes.

### Claim 14 (depends on 13)

The system of claim 13, wherein the data includes maxima and minima for each axis for the bounding volumes.

### Claim 15 (depends on 14)

The system of claim 14, wherein the maxima and minima are quantized.

### Claim 16 (depends on 15)

The system of claim 15, wherein the maxima and minima are in fixed point format.

### Claim 17 (depends on 16)

The system of claim 16, wherein a number of bits in values of the fixed point format are dependent on a level in the BVH of the nodes or are based on ranges of the maxima and minima.

### Claim 18 (depends on 10)

The system of claim 10, wherein the neural network provides outputs for multiple levels of the BVH for a single set of inputs.

### Claim 19

A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to perform operations comprising:
identifying one or more nodes for which a nearest neighbor search is to be performed;
applying data characterizing the one or more nodes to a neural network model to obtain outputs identifying one or more nearest neighbors; and
generating a portion of a bounding volume hierarchy (“BVH”) based on the one or more nearest neighbors.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein the identifying comprises identifying one or more nodes of the BVH that have no parent in the BVH.
