Ray Tracing Acceleration Structure Morton Code Bounding Box

The patent segments the continuous space into discrete bounding boxes organized in a hierarchical acceleration structure. Primitives are spatially classified and grouped into bounding boxes at multiple levels, allowing the ray tracing system to skip large portions of space that do not contain primitives, thereby reducing computational complexity while maintaining intersection accuracy.

The patent introduces an acceleration structure as an intermediary data structure between the ray tracing algorithm and the primitive data. This acceleration structure pre-organizes primitives into bounding boxes, serving as a mediator that filters potential ray-primitive intersections before performing actual intersection tests, thus reducing the computational burden on the main ray tracing process.

The patent applies preliminary action by pre-sorting primitives according to Morton codes before constructing the acceleration structure. This pre-sorting organizes primitives in a spatially coherent order that facilitates efficient bounding box construction and hierarchy formation, enabling faster acceleration structure generation while maintaining high-quality spatial classification.

The patent changes the parameter of primitive ordering by using Morton codes (a specific space-filling curve encoding) instead of traditional sorting methods. This parameter change in the ordering strategy enables more efficient spatial classification and accelerates the construction process by allowing linear-time sorting and simpler bounding box calculations.

The patent applies dynamics by adaptively adjusting the bounding box construction process based on the distribution of primitives and the desired tree depth. The method dynamically selects split planes and bounding box boundaries to maintain quality metrics even when the overall structure depth is reduced, allowing the system to flexibly balance between generation speed and bounding box quality.

The patent addresses the depth-quality tradeoff by introducing additional optimization dimensions beyond simple depth control. It uses Morton code-based spatial organization and adaptive bounding box refinement in multiple dimensions to maintain quality metrics while achieving reduced depth, effectively adding dimensional complexity to the construction process to solve the depth-quality contradiction.