Bounding Volume Hierarchy Box Splitting for Ray Tracing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ray tracing operations are inefficient due to large amounts of empty geometric space in bounding boxes and unoccupied space in bounding volume hierarchies, leading to false positives and inefficient processing.
Innovation Solution
A bounding volume hierarchy is modified to allow multiple box data items to point to the same box node, reducing empty space and improving traversal efficiency by splitting box data items to ensure full utilization of storage and processing resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional bounding volume hierarchy structures are used with separate box data items for each child node, then the hierarchy is simple to traverse, but empty geometric space and unoccupied storage space increase leading to false positives and inefficient processing
Solution Approach 1:
The patent merges multiple box data items that point to the same child node into a single shared box node. Instead of having separate box data items for each child node reference, the invention creates a shared box node that multiple parent nodes can reference, thereby eliminating empty geometric space and reducing false positives in ray tracing operations.
Solution Approach 2:
The shared box node serves multiple parent nodes simultaneously, making it a universal structure that fulfills the bounding volume function for multiple children. This multi-functional approach allows a single box node to be referenced by multiple parents, optimizing storage utilization and reducing the overall number of bounding boxes in the hierarchy.
2Quantity of substance
If multiple box data items point to the same box node, then storage space is better utilized and false positives are reduced, but the data structure becomes more complex to manage
Solution Approach 1:
Instead of creating multiple separate box data items that waste storage space, the invention creates a single shared box node that can be referenced by multiple parents. This copying approach allows the same bounding volume data to be reused across multiple parent nodes, significantly improving storage utilization while maintaining data integrity.
Solution Approach 2:
The patent creates equipotential relationships among multiple parent nodes by having them all reference the same shared box node. This equalizes the storage requirements across the hierarchy, ensuring that each parent node has access to the same efficient bounding volume representation, thereby optimizing overall storage utilization.
3Ease of manufacture
If box nodes are not fully utilized, then adding new children is simple, but processing efficiency decreases due to unoccupied space
Solution Approach 1:
The patent implements a dynamic bounding volume hierarchy where box nodes can be shared and reused across multiple parents. This dynamic structure allows the hierarchy to adapt to the actual geometric distribution of children, creating tightly-fitting bounding volumes that maximize space utilization and minimize empty geometric space, thereby improving traversal processing efficiency.
Data Source
AI summary
A technique for performing ray tracing operations is provided. The technique includes, testing a plurality of bounding boxes for intersection with a ray in parallel, wherein the plurality of bounding boxes are specified by a plurality of box data items of a parent box node of a bounding volume hierarchy; determining that, for a first child node that is pointed to by a two or more node pointers specified by two or more box data items of the plurality of box data items, at least one bounding box specified by the two or more box data items is intersected by the ray; and in response to the determining, traversing to the first child node.