Patent ID: 11928770
Assignee: ADVANCED MICRO DEVICES, INC.
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 20:
21. A method for traversing nodes in a bounding volume hierarchy (BVH) tree by an intersection engine, comprising:
receiving a traversal instruction, including a tracing-mode, ray data for a ray, and an identifier of a node to be traversed, wherein the tracing-mode of the traversal instruction comprises a first hit mode;
in response to a condition where the node to be traversed is an internal node, determining, according to the tracing-mode, an order in which children nodes of the node are to be next traversed based on a respective distance to each respective children node among the children node; and
outputting identifiers of the children nodes in the determined order,
wherein the respective distance is computed based on a crossing distance that is an absolute difference between a first location at which the ray enters a volume associated with a respective children node and a second location at which the ray exits the volume for the traversal instruction and the determined order for the traversal instruction orders the children nodes according to the respective distance in a descending order.