Patent ID: 9697640
Date: 2017-07-04
CPC Classifications: G06T

Claim:
1. A method comprising: organizing, by at least one processor, a plurality of bounding volumes in a hierarchical data structure; rasterizing, by the at least one processor, representations of the plurality of bounding volumes associated with non-root nodes of the hierarchical data structure as pixels to an off-screen render target; determining, by the at least one processor and based at least in part on sampling a color value of one of the pixels rasterized to the off-screen render target that is mapped to a ray, 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 whether the ray intersects a primitive bounded by one of the plurality of bounding volumes.