Tree Insertion Depth Adjustment Based on View Frustrum and Distance Culling

A method building an acceleration data structure having a plurality of nodes corresponding to a plurality of bounding volumes comprising divided portions of image data, the method comprising:

• determining a distance between a bounding volume of the plurality of bounding volumes and a reference;
• and
• modifying according to the distance a number of primitives placed into a node of the acceleration data structure that corresponds to the bounding volume.

An apparatus comprising:

• a memory configured to store image data logically divided into a plurality of bounding volumes and an acceleration data structure including nodes that correspond to the plurality of bounding volumes;
• and
• a processor in communication with the memory and configured to generate a ray that travels through the image data from a ray origin, wherein the processor is further configured to modify a size of a bounding volume of the plurality according to a distance measured from a reference point to the bounding volume.

An apparatus comprising:

• a memory configured to store image data logically divided into a plurality of bounding volumes and an acceleration data structure including nodes that correspond to the plurality of bounding volumes;
• and
• a processor in communication with the memory and configured to generate a ray that travels through the image data from a ray origin, wherein the processor is further configured to modify a number of primitives placed into a node of the acceleration data structure according to a distance measured from a reference point to the bounding volume of the plurality, wherein the node corresponds to the bounding volume.

A program product, comprising:

• program code configured to conduct ray tracing with image data logically divided into a plurality of bounding volumes and to modify a number of primitives placed into a node of an acceleration data structure according to a distance measured from a reference point to a bounding volume of the plurality, wherein the node corresponds to the bounding volume;
• and a computer readable medium bearing the program code.