Stochastic BVH Construction for Real-Time Ray Tracing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Ray tracing operations, particularly ray-scene intersection processing in bounding volume hierarchies (BVH), are resource-intensive and inefficient for real-time performance in graphics processing.

Innovation Solution

Implementing stochastic processing for BVH construction, which includes techniques such as Hierarchical Bit-Vector Indexing (HBI) and on-demand builder for acceleration structures, to optimize ray traversal and intersection operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional BVH construction methods are used for ray tracing, then ray-scene intersection processing can be performed, but resource utilization is high and real-time performance is insufficient

Engineering Contradiction:
Improveray tracing processing speedVSAvoidresource utilization
Core Design Contradiction:
ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies preliminary action by constructing the BVH acceleration structure in advance using stochastic processing methods (HBI, on-demand builder) before ray tracing operations begin. This pre-construction phase organizes scene geometry into hierarchical bounding volumes, enabling rapid ray traversal during actual rendering without performing heavy computation in real-time, thus improving processing speed while managing resource utilization.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent segments the scene geometry into hierarchical levels of bounding volumes (root node to leaf nodes) in the BVH structure. This segmentation allows ray tracing to traverse only relevant portions of the scene by pruning unrelated branches, significantly reducing the computational resources needed per ray query while maintaining high processing throughput across many rays.

Inventive Principle:
Principle #1Segmentation

2Loss of time

If deterministic BVH construction is used, then structured acceleration data is created, but processing time and computational overhead increase

Engineering Contradiction:
ImproveBVH construction timeVSAvoidconstruction algorithm complexity
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The patent replaces traditional deterministic mechanical construction algorithms with stochastic processing methods. Instead of following fixed deterministic rules for BVH node creation and organization, the system uses probabilistic approaches (HBI with random shuffling, on-demand builder with stochastic sampling) that reduce computational overhead and construction time while still producing effective acceleration structures through statistical optimization.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent changes the construction approach from deterministic parameter-based algorithms to stochastic parameter sampling. By introducing randomness in node selection, splitting criteria, and traversal ordering, the system reduces algorithmic complexity and construction time while maintaining adequate BVH quality for ray tracing performance through statistical convergence properties.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12548255B2Apparatus and method for bounding volume hierarchy (BVH) construction with stochastic processing
Publication Date: 2026.02.10 INTEL CORP
  • US12548255B2 patent drawing
  • US12548255B2 patent drawing
  • US12548255B2 patent drawing

AI summary

A method and apparatus for efficiently constructing a bounding volume hierarchy (BVH). For example, one embodiment of an apparatus comprises: a primitive sampler to identify a representative subset of input primitives of a graphics scene; bounding volume hierarchy (BVH) builder hardware logic to construct an approximate BVH based on the representative subset of input primitives; hardware logic to insert input primitives not in the representative subset into leaves of the approximate BVH; and the BVH builder or a different BVH builder to construct a final BVH based on the primitives inserted into the leaves of the approximate BVH.