49 results about "Bounding volume hierarchy" patented technology

Different rendering techniques are selected for portions of a scene based on statistical estimates of the portions' rendering costs. A scene is partitioned into a bounding volume hierarchy. Each bounding volume includes a statistical model of the spatial distribution of geometric primitives within the bounding volume. An image to be rendered is partitioned into screen regions and each screen region is associated with one or more bounding volumes and their statistical models. The associated statistical models of a screen region are evaluated to estimate the rendering cost, such as the probable number of geometric primitives per pixel, for the screen region. Based on the rendering cost, the screen region is assigned to a dense geometry renderer, such as a ray tracing renderer, or a sparse geometry renderer, such as a rasterization renderer. Rendered screen regions are combined to form a rendered image.

A system, method, and computer program product are provided for modifying a hierarchical tree data structure. An initial hierarchical tree data structure is received and treelets of node neighborhoods in the initial hierarchical tree data structure are formed. Each treelet includes n leaf nodes and n−1 internal nodes. The treelets are restructured, by a processor, to produce an optimized hierarchical tree data structure.

Methods, systems, devices, and computer program code (software) products enable acceleration of ray tracing by using acceleration data structures with high arity to enable processing of nodes using streaming SIMD (Single Instruction, Multiple Data) instructions with reduced memory requirements.

Some aspects of the disclosure include systems and methods for grouping rays into sets according to their directions. In some cases, the rays of the directional sets may then be organized into a hierarchy according to their origins and bounding cones are generated for the hierarchy nodes. The resulting bounding cone hierarchy may be intersected with a bounding volume hierarchy or other scene hierarchy.

An apparatus and method are described for using tessellation hardware to generate bounding volume hierarchies (BVHs) and perform other ray tracing operations. For example, one embodiment of an apparatus comprises: a shader to output a plurality of tessellation factors and one or more input surfaces; and a tessellation circuit comprising first circuitry and / or logic to tesselate each input surface to generate a new set of primitives and second circuitry and / or logic to concurrently generate a bounding volume hierarchy (BVH) based on the new set of primitives.

Apparatus and method for a compressed stack representation for a BVH. For example, one embodiment of an apparatus comprises: a ray generator to generate a plurality of rays in a first graphics scene; a bounding volume hierarchy (BVH) generator to construct a BVH comprising a plurality of hierarchically arranged nodes, wherein the BVH comprises a specified number of child nodes at a current BVH level beneath a parent node in the hierarchy; traversal / intersection circuitry to traverse one or more of the rays through the hierarchically arranged nodes of the BVH and intersect the one or more rays with primitives contained within the nodes; a short traversal stack of a fixed size comprising a specified number of entries fewer than the number of child nodes beneath the parent node, each entry associated with a child node at the current BVH level, the entries ordered from top to bottom within the short traversal stack based on a sorted distance of each respective child node, wherein each entry includes a field to indicate whether that entry is associated with a final child in the current BVH level; wherein the traversal / intersection circuitry is to process entries from the top of the traversal stack, removing entries as they are processed, the traversal / intersection circuitry to determine that a current entry is associated with the final child node at the current BVH level by reading a first value in the field.

Apparatus and method for double-precision traversal and intersection. For example, one embodiment of an apparatus comprises: a bounding volume hierarchy (BVH) generator to construct a BVH comprising a plurality of hierarchically arranged BVH nodes; a ray storage to store rays to be traversed through one or more of the BVH nodes; ray traversal circuitry comprising a first plurality of 64-bit arithmetic logic units (ALUs) which natively support double-precision floating point operations, the ray traversal circuitry to use at least a first ALU of the one or more ALUs to traverse a first ray through a first BVH node at a double-precision floating point precision to generate double-precision floating point traversal results; a plurality of execution units (EUs) coupled to the ray traversal circuitry, at least one of the plurality of EUs comprising a second plurality of 64-bit ALUs capable of natively performing double-precision floating point operations, the at least one of the plurality of EUs to execute one or more intersection shaders to perform ray-primitive intersection testing at double-precision floating point precision based on the double-precision floating point traversal results.

The invention discloses a polluted water environment three-dimensional rapid display method and a system. The method comprises: sensing information of each water area by a corresponding sensor, and transmitting data back at regular time, storing information sensed by sensors to a database; establishing a case library in accordance with five types of the national water quality standard; dividing a water environment three-dimensional scene, and establishing a scene tree based on a BSP tree structure with a water area target knot as an organization unit; conducting view frustum culling based on a bounding volume hierarchy of the scene tree; determining the grade of water quality based on the data sensed by sensors; looking for corresponding cases in the library based on the determination result, and displaying water quality graphics; and looking for water quality information by clicking. The method and the system of the invention obviate the need for experts to observe water quality on site, realize rapid display of polluted water environment three-dimensional graphics, can conduct automatic selection of corresponding water quality graphics, and enable experts to roam in the water environment three-dimensional scene and observe, look for real-time information of current water area, and facilitate experts' research on polluted water environment.

Some aspects of the disclosure include systems and methods for grouping rays into sets according to their directions. In some cases, the rays of the directional sets may then be organized into a hierarchy according to their origins and bounding cones are generated for the hierarchy nodes. The resulting bounding cone hierarchy may be intersected with a bounding volume hierarchy or other scene hierarchy.

A system, method, and computer program product are provided for modifying a hierarchical tree data structure. An initial hierarchical tree data structure is received and treelets of node neighborhoods in the initial hierarchical tree data structure are formed. Each treelet includes n leaf nodes and n−1 internal nodes. The treelets are restructured, by a processor, to produce an optimized hierarchical tree data structure.

The invention discloses a bounding volume hierarchy design method targeted at motion blur. The method includes two parts: a construction period and a traversal period. In the construction period, the method includes the following steps: in a node of a BVH structure, finding out all surface patches with irregular motion behaviors; collecting all surface patches with the above mentioned characteristics and placing the surface patches at a special node: MB node and recording a time point when the surface patches cross a dividing plane at the same time; and after the MB node is generated, setting a threshold, when surface patches which move into the MB node cover more than 50% of all the surface patches, according to an SAH cost model, recalculating the potion of a division point on the basis of remaining surface patches in the node so as to generate new left and right sub-nodes. In the traversal period, the method includes the following steps: instructing the irregular surface patches in the MB node to be redistributed; re-dividing all the surface patches in the MB node into corresponding left and right sub-nodes; and then re-calculating corresponding node bounding volume hierarchies and adjusting downward bounding volume hierarchies of sub-nodes and carrying out recursion on the process until the whole updating work is completed.

An apparatus and method for performing BVH compression and decompression concurrently with stores and loads, respectively. For example, one embodiment comprises: bounding volume hierarchy (BVH) construction circuitry to build a BVH based on a set of input primitives, the BVH comprising a plurality of uncompressed coordinates; traversal / intersection circuitry to traverse one or more rays through the BVH and determine intersections with the set of input primitives using the uncompressed coordinates; store with compression circuitry to compress the BVH including the plurality of uncompressed coordinates to generate a compressed BVH with compressed coordinates and to store the compressed BVH to a memory subsystem; and load with decompression circuitry to decompress the BVH including the compressed coordinates to generate a decompressed BVH with the uncompressed coordinates and to load the decompressed BVH with uncompressed coordinates to a cache and / or a set of registers accessible by the traversal / intersection circuitry.