Rendering tessellated geometry with motion and defocus blur

1. A method comprising:

stochastically rendering a moving or defocused geometry by grouping a plurality of primitives of said geometry in a hierarchical data structure;

traversing samples through said structure;

performing said rendering and traversing in a rasterization pipeline;

locating visible samples in said data structure by hierarchically traversing a frustum through the structure;

optimizing per-sample traversal by determining a branch node during frustum traversal, and initiating per-sample traversal at the branch node;

forming said data structure of time-dependent bounding boxes;

testing the frustum against a hierarchy of time-dependent bounding boxes; and

using tessellation order to avoid sorting when building the hierarchical data structure.

2. The method of claim 1 including determining screen space bounds by projecting a top level of a time-dependent bounding box hierarchy.

3. The method of claim 1 including forming said data structure entirely of two dimensional screen space bounding boxes.

4. The method of claim 1 including using time and lens parameters discretized to a fixed number of values.

5. A non-transitory computer readable medium storing instructions to enable a computer to:

stochastically render a moving or defocused geometry by grouping a plurality of primitives of said geometry in a hierarchical data structure;

traverse samples through said structures;

perform said rendering and traversing in a rasterization pipeline;

locate visible samples in said data structure by hierarchically traversing a frustum through the structure;

optimize per-sample traversal by determining a branch node during frustum traversal, and initiating per-sample traversal at the branch node;

forming said data structure of time-dependent bounding boxes;

test the frustum against a hierarchy of time-dependent bounding boxes; and

use tessellation order to avoid sorting when building the hierarchical data structure.

6. The medium of claim 5 further storing instructions to determine screen space bounds by projecting a top level of a time-dependent bounding box hierarchy.

7. The medium of claim 5 further storing instructions to form said data structure entirely of two dimensional screen space bounding boxes.

8. The medium of claim 5 further storing instructions to use time and lens parameters discretized to a fixed number of values.

9. An apparatus comprising:

a memory; and

a processor coupled to said memory to stochastically render a moving or defocused geometry by grouping a plurality of primitives of said geometry in a hierarchical data structure, traverse samples through the structure, perform said rendering and traversing in a rasterization pipeline, locate visible samples in said data structure by hierarchically traversing a frustum through the structure, optimize per-sample traversal by determining a branch node during frustum traversal, initiate per-sample traversal at the branch node, form said data structure of time-dependent bounding boxes, test the frustum against a hierarchy of time-dependent bounding boxes; and use tessellation order to avoid sorting when building the hierarchical data structure.

10. The apparatus of claim 9 , said processor to determine screen space bounds by projecting a top level of a time-dependent bounding box hierarchy.

11. The apparatus of claim 9 , said processor to form said data structure entirely of two dimensional screen space bounding boxes.

12. The apparatus of claim 9 , said processor to use time and lens parameters discretized to a fixed number of values.