Bounding Volume Hierarchy Traversal

2. The method of claim 1, wherein the bounding volume hierarchy traversal is initiated in response to spawning a ray for intersection testing against geometry of a scene represented by the bounding volume hierarchy.

3. The method of claim 1, further comprising placing node pointers into a collection in response to detecting that the ray intersects a box node, wherein the node pointers are pointers to child nodes of the box node.

4. The method of claim 3, wherein identifying the multiple nodes comprises selecting nodes from the collection.

5. The method of claim 1, wherein performing the intersection test includes performing memory access requests to fetch data for the multiple nodes in a manner that the memory access requests are outstanding at the same time.

6. The method of claim 5, wherein the memory access requests are outstanding at the same time as memory access requests to fetch node data for nodes for a different ray.

7. The method of claim 1, wherein the intersection test includes operations to fetch data for the multiple nodes and operations to perform an intersection test between geometry indicated by the fetched data and the ray.

8. The method of claim 1, further comprising repeating the identifying and intersection test until traversal of the bounding volume hierarchy is complete.

9. The method of claim 8, wherein the bounding volume hierarchy is complete in the situation that a collection storing nodes to perform intersection tests for is empty when no outstanding intersection tests exist.

11. The system of claim 10, wherein the bounding volume hierarchy traversal is initiated in response to spawning a ray for intersection testing against geometry of a scene represented by the bounding volume hierarchy.

12. The system of claim 10, wherein the ray intersection test processor is further configured to place node pointers into a collection in response to detecting that the ray intersects a box node, wherein the node pointers are pointers to child nodes of the box node.

13. The system of claim 12, wherein identifying the multiple nodes comprises selecting nodes from the collection.

14. The system of claim 10, wherein performing the intersection test includes performing memory access requests to fetch data for the multiple nodes in a manner that the memory access requests are outstanding at the same time.

15. The system of claim 14, wherein the memory access requests are outstanding at the same time as memory access requests to fetch node data for nodes for a different ray.

16. The system of claim 10, wherein the intersection test includes operations to fetch data for the multiple nodes and operations to perform an intersection test between geometry indicated by the fetched data and the ray.

17. The system of claim 10, wherein the ray intersection test processor is further configured to repeat the identifying and intersection test until traversal of the bounding volume hierarchy is complete.

18. The system of claim 17, wherein the bounding volume hierarchy is complete in the situation that a collection storing nodes to perform intersection tests for is empty when no outstanding intersection tests exist.

20. The non-transitory computer-readable medium of claim 19, wherein the bounding volume hierarchy traversal is initiated in response to spawning a ray for intersection testing against geometry of a scene represented by the bounding volume hierarchy.