Graphics Processing for Ray Tracing with Bounding Box and Plane BVHs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing ray tracing techniques are processing-intensive and require improved acceleration methods to enhance efficiency.
Innovation Solution
A graphics processing system uses a ray tracing acceleration data structure that includes both axis-aligned bounding boxes and planes to define node volumes, allowing for more accurate representation of geometry distribution and reducing processing requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional ray tracing is used to render frames, then image quality and realism are improved, but processing time and computational complexity increase significantly
Solution Approach 1:
The patent segments the scene geometry into multiple bounding volume hierarchies (BVHs), where each BVH represents a subset of geometry. This segmentation allows the ray tracing algorithm to traverse only relevant BVHs for each ray, reducing the number of intersection tests performed and thereby decreasing processing time while maintaining image quality
Solution Approach 2:
The patent performs preliminary organization of scene geometry into BVH structures before ray tracing begins. By pre-computing the hierarchical bounding volume structures and organizing geometry spatially in advance, the system reduces the computational burden during actual ray tracing operations, thus reducing processing time without compromising rendering quality
2Productivity
If ray tracing acceleration data structures are used, then processing speed is improved, but device complexity increases
Solution Approach 1:
The patent divides the scene into multiple BVHs based on geometry subsets, which simplifies each individual data structure compared to a single comprehensive BVH. This segmentation makes the data structures more manageable and easier to traverse, reducing the effective complexity encountered during ray tracing while improving processing speed through selective traversal
Solution Approach 2:
The patent introduces a hierarchical dimension to the data structure organization by creating multi-level BVHs with parent-child relationships. This hierarchical arrangement organizes geometry in multiple dimensions (spatial and hierarchical), allowing for more efficient traversal by enabling early culling of entire subtrees, thus improving processing speed while keeping individual node complexity manageable
Data Source
AI summary
A graphics processing system that is operable to perform ray tracing is disclosed. It may be determined whether a ray may intersect geometry associated with a node by testing the ray against two different types of geometric object associated with the node: a first type that defines the volume that the node represents, and a second, different type that defines a region of the volume that the node represents within which geometry does not fall.