Multiple-Bound BVH Child Nodes for Efficient Ray Traversal

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Ray tracing operations in graphics processing are resource-intensive and inefficient due to the high computational demands of processing visibility queries for ray-scene intersections in bounding volume hierarchies (BVHs).

Innovation Solution

The use of multiple bounds to bound child nodes in a bounding volume hierarchy (BVH) improves the efficiency of ray tracing by optimizing the traversal process, allowing for more efficient ray-scene intersection computations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional single bound is used for child nodes in BVH, then the structure is simple, but ray traversal efficiency is low due to excessive computational demands

Engineering Contradiction:
Improveray tracing efficiencyVSAvoidBVH structure complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent divides the single bounding volume for each child node into multiple separate bounding volumes (first bound and second bound). This segmentation allows the ray traversal algorithm to perform multiple quick rejection tests before performing expensive intersection tests, thereby improving ray tracing efficiency while maintaining manageable structural complexity through systematic organization of the multiple bounds.

Inventive Principle:
Principle #1Segmentation

2Productivity

If multiple bounds are used for child nodes in BVH, then ray traversal efficiency improves, but memory usage increases

Engineering Contradiction:
Improveray traversal efficiencyVSAvoidmemory consumption
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent implements a nested bounding volume hierarchy where multiple bounds for each child node are organized in a hierarchical structure. The first bound and second bound are nested within the parent node's bounding volume, creating a multi-level filtering system. This nesting approach improves ray traversal efficiency by enabling progressive rejection of non-intersecting rays while using memory efficiently through the hierarchical organization that shares common spatial information across multiple levels.

Inventive Principle:
Principle #7Nested doll (Nesting)

Data Source

PatentUS20250299420A1Apparatus and method for using multiple bounds for child nodes in a bounding volume hierarchy
Publication Date: 2025.09.25 INTEL CORP
  • US20250299420A1 patent drawing
  • US20250299420A1 patent drawing
  • US20250299420A1 patent drawing

AI summary

Apparatus and method for using multiple bounds to bound BVH child nodes. For example, one embodiment of an apparatus comprises: traversal hardware logic to traverse rays through a bounding volume hierarchy (BVH); and BVH construction circuitry to evaluate nodes of an N-wide BVH, the BVH construction circuitry to generate a union of multiple bounding boxes for one or more child nodes of the BVH to produce one or more corresponding union-bounded child nodes, wherein a node of the BVH stores N bounding boxes and each corresponding child node of the BVH is bounded by 0 to N of the bounding boxes; the traversal hardware logic to traverse a ray through the N-wide BVH and to determine a hit with respect to each union-bounded child node if any of the bounding boxes associated with the union-bounded child node are hit by the ray.