ARCHITECTURES FOR PARALLELIZED INTERSECTION TESTING AND SHADING FOR RAY-TRACING RENDERING

摘要

In an example, ray tracing scenes includes using a plurality of intersection testing resources coupled with a plurality of shading resources, communicative in the aggregate through links/queues. A queue from testing to shading comprises respective ray/primitive intersection indications, comprising ray identifiers. A shading to testing queue comprises identifiers of new rays for test, wherein data defining the rays is separately stored in memories distributed among the intersection testing resources. Ray definition data can be retained in distributed memories until rays complete intersection testing, being selectable for testing multiple times based on ray identifier. A structure of acceleration shapes can be used. Packets of ray identifiers and shape data can circulate among intersection testing resources, each resource can test rays identified in the packet, and for which definition data is present in its memory. Acceleration shape test results allow collection of rays based on intersected shape, and closest detection ray/primitive intersections are indicated by queuing ray identifiers for shading.