START NODE DETERMINATION FOR TREE TRAVERSAL IN RAY TRACING APPLICATIONS

摘要

At least one processor may organize a plurality of primitives in a hierarchical data structure. The at least one processor may rasterize a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure to an off-screen render target. The at least one processor may determine a bounding volume that is intersected by a ray out of the plurality of bounding volumes. The at least one processor may determine a non-root node of the hierarchical data structure that is associated with the bounding volume as a start node in the hierarchical data structure to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine the primitive that is intersected by the ray.

主权项

1. A method comprising:
organizing, by at least one processor, a plurality of primitives in a hierarchical data structure; rasterizing, by the at least one processor, a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure to an off-screen render target; determining, by the at least one processor and based on rasterizing the plurality of bounding volumes to the off-screen render target, a non-root node of the hierarchical data structure as a start node in the hierarchical data structure to start traversal of the hierarchical data structure; and traversing, by the at least one processor, the hierarchical data structure starting from the start node to determine the primitive that is intersected by a ray.