IP Library Granted Patent US 12,548,255
Granted Patent B2
US 12,548,255 · App. 17/852,216 · Granted Feb 10, 2026

Apparatus and method for bounding volume hierarchy (BVH) construction with stochastic processing

Inventors: Lorenzo Tessari (Karlsruhe, DE); Addis Dittebrandt (Karlsruhe, DE); Michael Doyle (San Jose, CA); Carsten Benthin (Voelklingen, DE)
Assignee: Intel Corporation
G06T17/20G06T1/20G06T15/005G06T15/06
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,548,255
App. No.
17/852,216
Granted
Feb 10, 2026
Kind
B2
Abstract

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.

Claims (45)

1 . An apparatus comprising:

sampler circuitry to identify a representative subset of input primitives of a graphics scene for bounding volume hierarchy (BVH) construction;

BVH builder circuitry to construct an approximate BVH based on the representative subset of input primitives;

circuitry to insert input primitives not in the representative subset into leaves of the approximate BVH; and

the BVH builder circuitry or a different BVH builder circuitry to construct a final BVH based on the primitives inserted into the leaves of the approximate BVH.

2 . The apparatus of claim 1 wherein the sampler circuitry is to perform stochastic importance sampling to identify the representative subset of input primitives.

3 . The apparatus of claim 2 wherein selection of the subset of input primitives is biased to primitives that have a greater influence on the approximate BVH.

4 . The apparatus of claim 3 wherein relatively larger primitives are biased to be selected over relatively smaller primitives.

5 . The apparatus of claim 4 wherein a Cumulative Density Function (CDF) is implemented to identify the subset of input primitives.

6 . The apparatus of claim 1 wherein the BVH builder circuitry or the different BVH builder circuitry is to operate in parallel on the leaves after the input primitives not in the representative subset are inserted to construct the final BVH.

7 . The apparatus of claim 1 further comprising:

compression circuitry to perform compression and/or quantization on nodes of the final BVH to generate a compressed final BVH.

8 . The apparatus of claim 1 further comprising:

traversal circuitry to traverse a ray through the final BVH; and

intersection circuitry to identify intersections between the ray and one or more of the input primitives.

9 . A method comprising:

sampling input primitives of a graphics scene to identify a representative subset of the input primitives for bounding volume hierarchy (BVH) construction;

constructing an approximate BVH based on the representative subset of input primitives;

inserting input primitives not in the representative subset into leaves of the approximate BVH; and

constructing a final BVH based on the primitives inserted into the leaves of the approximate BVH.

10 . The method of claim 9 wherein sampling input primitives further comprises performing stochastic importance sampling to identify the representative subset of input primitives.

11 . The method of claim 10 selection of the subset of input primitives is biased to primitives that have a greater influence on the approximate BVH.

12 . The method of claim 11 wherein relatively larger primitives are biased to be selected over relatively smaller primitives.

13 . The method of claim 12 wherein a Cumulative Density Function (CDF) is implemented to identify the subset of input primitives.

14 . The method of claim 9 wherein constructing the final BVH further comprises operating in parallel on the leaves after the input primitives not in the representative subset are inserted.

15 . The method of claim 9 further comprising:

performing compression and/or quantization on nodes of the final BVH to generate a compressed final BVH.

16 . The method of claim 9 further comprising:

traversing a ray through the final BVH; and

identifying intersections between the ray and one or more of the input primitives.

17 . A non-transitory machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform:

sampling input primitives of a graphics scene to identify a representative subset of the input primitives for bounding volume hierarchy (BVH) construction;

constructing an approximate BVH based on the representative subset of input primitives;

inserting input primitives not in the representative subset into leaves of the approximate BVH; and

constructing a final BVH based on the primitives inserted into the leaves of the approximate BVH.

18 . The non-transitory machine-readable medium of claim 17 wherein sampling input primitives further comprises performing stochastic importance sampling to identify the representative subset of input primitives.

19 . The non-transitory machine-readable medium of claim 18 selection of the subset of input primitives is biased to primitives that have a greater influence on the approximate BVH.

20 . The non-transitory machine-readable medium of claim 19 wherein relatively larger primitives are biased to be selected over relatively smaller primitives.

21 . The non-transitory machine-readable medium of claim 20 wherein a Cumulative Density Function (CDF) is implemented to identify the subset of input primitives.

22 . The non-transitory machine-readable medium of claim 17 wherein constructing the final BVH further comprises operating in parallel on the leaves after the input primitives not in the representative subset are inserted.

23 . The non-transitory machine-readable medium of claim 17 further comprising program code to cause the machine to perform:

performing compression and/or quantization on nodes of the final BVH to generate a compressed final BVH.

24 . The non-transitory machine-readable medium of claim 17 further comprising program code to cause the machine to perform:

traversing a ray through the final BVH; and

identifying intersections between the ray and one or more of the input primitives.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2023
From: TESSARI, LORENZ0; DITTEBRANDT, ADDIS; DOYLE, MICHAEL; BENTHIN, CARSTEN
To: INTEL CORPORATION
Reel/Frame 062609/0785 →
Continuity (2)
Provisional Application 63343356 · May 18, 2022
Related Publication 20230377267A1 · Nov 23, 2023
References Cited (30)
US 10839475B2 · Benthin et al. · 2020 [cited by applicant]
US 11321910B2 · Doyle et al. · 2022 [cited by applicant]
US 20190318445A1 · Benthin · 2019 [cited by examiner]
US 20210109987A1 · Avila · 2021 [cited by examiner]
US 20210133915A1 · Benthin et al. · 2021 [cited by applicant]
European Search Report and Search Opinion, EP App. No. 23167897.0, Sep. 28, 2023, 13 pages. [cited by applicant]
Hu et al., “Parallel BVH Construction Using Locally Density Clustering”, IEEE, 2019, pp. 105827-105839. [cited by applicant]
Meister et al., “Parallel BVH construction using k-means clustering”, Springer, 2016, 11 pages. [cited by applicant]
Tessari et al., “Stochastic Subsets for BVH Construction”, vol. 42, 2023, 13 pages. [cited by applicant]
Aila et al., “On Quality Metrics of Bounding Volume Hierarchies”, NVIDIA, Proceedings of the 5th High-Performance Graphics Conference, 2013, 7 pages. [cited by applicant]
Bittner et al., “Fast Insertion-Based Optimization of Bounding Volume Hierarchies”, Computer Graphics Forum, vol. 32, 2013, 16 pages. [cited by applicant]
Bittner et al., “Incremental BVH Construction for Ray Tracing”, Computers & Graphics, Dec. 8, 2014, 11 pages. [cited by applicant]
Domingues et al., “Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring”, Proceedings of the 7th Conference on High-Performance Graphics, Aug. 7-9, 2015, pp. 13-20. [cited by applicant]
Garanzha et al., “Grid-based SAH BVH Construction on a GPU”, Visual Computer, vol. 27, May 5, 2011, 10 pages. [cited by applicant]
Goldsmith et al., “Automatic Creation of Object Hierarchies for Ray Tracing”, IEEE Computer Graphics and Applications, vol. 7, No. 5, May 1987, pp. 14-20. [cited by applicant]
Hendrich et al., “Parallel BVH Construction using Progressive Hierarchical Refinement”, Eurographics, Computer Graphics Forum, vol. 36, No. 2, 2017, 8 pages. [cited by applicant]
Karras et al., “Fast Parallel Construction of High-Quality Bounding Volume Hierarchies”, ACM, Proceedings of the 5th High-Performance Graphics Conference, Jul. 19-21, 2013, pp. 89-100. [cited by applicant]
Laine, Samuli, “Restart Trail for Stackless BVH Traversal”, High Performance Graphics, The Eurographics Association, 2010, 5 pages. [cited by applicant]
Lauterbach et al., “Fast BVH Construction on GPUs”, Eurographics, Computer Graphics Forum, vol. 28, No. 2, 2009, 10 pages. [cited by applicant]
Lauterbach et al., “RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs”, IEEE Symposium on Interactive Ray Tracing, 2006, 8 pages. [cited by applicant]
Llyod et al., “Implementing Stochastic Levels of Detail with Microsoft DirectX Raytracing”, NVIDIA Developer, Technical Blog, Jun. 15, 2020, 6 pages. [cited by applicant]
Meister et al., “A Survey on Bounding Volume Hierarchies for Ray Tracing”, Eurographics, Computer Graphics Forum, vol. 40, No. 2, 2021, 30 pages. [cited by applicant]
Meister et al., “Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction”, IEEE Transactions on Visualization and Computer Graphics (Preprint), 2017, pp. 1-9. [cited by applicant]
Meister et al., “Parallel Reinsertion for Bounding Volume Hierarchy Optimization”, Eurographics, Computer Graphics Forum, vol. 37, No. 2, 2018, 11 pages. [cited by applicant]
Ng et al., “Automatic Bounding Volume Hierarchy Generation Using Stochastic Search Methods”, Mini-Workshop on Stochastic Search Algorithms, 2003, 16 pages. [cited by applicant]
Niederreiter et al., “Monte Carlo and Quasi-Monte Carlo Methods”, Springer, 2006, 505 pages. [cited by applicant]
Office Action, EP App. No. 23167897.0, Mar. 28, 2025, 6 pages. [cited by applicant]
Pantaleoni et al., “HLBVH: Hierarchical LBVH Construction for Real-Time Ray Tracing of Dynamic Geometry”, High Performance Graphics, The Eurographics Association, 2010, 10 pages. [cited by applicant]
Vinkler et al., “Extended Morton Codes for High Performance Bounding Volume Hierarchy Construction”, ACM, Proceedings of High Performance Graphics, 2017, 8 pages. [cited by applicant]
Wald, Ingo, “On Fast Construction of SAH-based Bounding Volume Hierarchies”, 2007 IEEE Symposium on Interactive Ray Tracing, 2007, 8 pages. [cited by applicant]