110 results about "Bounding volume hierarchy" patented technology

A technique for performing ray tracing operations is provided. The technique includes traversing a bounding volume hierarchy for a ray to arrive at a bounding box without use of a neural network; perform a feature vector lookup using modified polar coordinates characterizing the ray relative to the bounding box to obtain a set of feature vectors; and obtaining output with the neural network using the set of feature vectors.

This disclosure provides systems, devices, apparatus, and methods, including computer programs encoded on storage media, for adaptive BVH rebuilds with biased cost functions for dynamic geometry. A graphics processor may obtain an indication of first BVH structure(s) including first nodes, where the first BVH structure(s) are representative of first geometry data for first primitives in first frame(s), where each of the first nodes is associated with first primitive(s), may detect a number of rays that intersect each of the first BVH structure(s) from direction(s) associated with the first frame(s), may update a cost function based on the number of rays and each of the direction(s), and may configure, based on the updated cost function, second BVH structure(s) including second nodes, where the second BVH structure(s) are representative of second geometry data for second primitives in second frame(s), where each of the second nodes is associated with second primitive(s).

This disclosure provides systems, devices, apparatus, and methods, including computer programs encoded on storage media, for exploiting spatial locality to speed up first-hit ray BVH traversals. A processor may generate a bounding volume hierarchy (BVH) hit map based a set of pixels, where the BVH hit map includes entries indicative of intersection information for a set of rays associated with the set of pixels, and where the BVH hit map corresponds to a BVH. The processor may select an entry from the entries of the BVH hit map based on pixel coordinate information for the set of pixels. The processor may traverse the BVH from a node of the BVH associated with the selected entry.

The invention discloses an apparatus and method for converting compressed geometries into accelerated data structures. An apparatus and method for transforming lossy compressed geometries into a bounding volume hierarchy. For example, one embodiment of a method includes constructing a bounding volume hierarchy (BVH) based on a compressed hierarchy (LOD) structure formed from iteratively merged geometric primitive cluster pairs, where constructing the BVH includes traversing the compressed hierarchy (LOD) structure, to select a subset of the cluster on one or more levels of a compressed hierarchy (LOD) structure based on the current cone of view; decompressing each cluster and constructing a per-cluster BVH on the primitive of each cluster, wherein each per-cluster BVH comprises a per-cluster BVH root node; and fusing the per-cluster BVH root nodes to form a BVH, the BVH being used to efficiently ray trace all decompressed geometric primitives in the scene.

A method performed by a graphics processor searches for a candidate reinsertion for each of a plurality of input nodes of a current bounding volume hierarchy (BVH) which would move the input node from an old parent to a new parent, and which would reduce an expected computational cost of searching the BVH for a ray intersection; and performs a first update to update the current BVH with one or more selected reinsertions from among the candidates. The selection comprises a conflict check to determine whether any group of the candidates would affect a same part of the current BVH, and if so selecting only one of the group to include in the first update. At least one of the iterations further comprises, after the first update, performing a second update within the same iteration to update the current BVH with another of said group.

Apparatus and method for using multiple bounds to bound BVH child nodes. For example, one embodiment of an apparatus comprises: traversal hardware logic to traverse rays through a bounding volume hierarchy (BVH); and BVH construction circuitry to evaluate nodes of an N-wide BVH, the BVH construction circuitry to generate a union of multiple bounding boxes for one or more child nodes of the BVH to produce one or more corresponding union-bounded child nodes, wherein a node of the BVH stores N bounding boxes and each corresponding child node of the BVH is bounded by 0 to N of the bounding boxes; the traversal hardware logic to traverse a ray through the N-wide BVH and to determine a hit with respect to each union-bounded child node if any of the bounding boxes associated with the union-bounded child node are hit by the ray.

Apparatus and method for manageable fragmented acceleration structures. For example, one embodiment of an apparatus comprises: acceleration structure construction logic to build an acceleration structure (AS) including a multi-level linkage hierarchy with different types of AS fragments, the different types of AS fragments including a first type of AS fragments with leaves, a second type of AS fragments including AS linkages, and a third type of AS fragment including both leaves and AS linkages, wherein to construct an AS fragment, the acceleration structure construction logic is to: evaluate a plurality of primitive references, determine whether each primitive reference indicates a primitive or an AS fragment, and if the primitive reference indicates an AS fragment, then encode a pointer or offset directly or indirectly into a bounding volume hierarchy (BVH) of the AS fragment; and traversal hardware logic to traverse a ray through the AS.

Systems and techniques are provided for widening a layered structure for ray tracing. For example, a process may include obtaining a plurality of primitives of a scene object included in a first hierarchical acceleration data structure; and determining one or more candidate hierarchical acceleration data structures, each candidate hierarchical acceleration data structure comprising the plurality of primitives. A cost metric for the one or more candidate hierarchical acceleration data structures may be determined, and based on the cost metric, a compressibility prediction associated with a candidate hierarchical acceleration data structure of the one or more candidate hierarchical acceleration data structures may be determined. An output hierarchical acceleration data structure may be generated based on the compressibility prediction.

A technique for performing ray tracing operations is provided. The technique includes identifying triangles to include in a compressed triangle block; storing data common to the identified triangles as common data of the compressed triangle block; and storing data unique to the identified triangles as unique data of the compressed triangle block.

Aspects presented herein relate to methods and devices for graphics processing including an apparatus, e.g., a GPU. The apparatus may obtain an indication of a BVH structure associated with a view frustum, where the BVH structure includes at least one first-level BVH including a plurality of first-level nodes and a plurality of second-level BVHs including a plurality of second-level nodes. The apparatus may also calculate whether the view frustum intersects with each first-level bounding box in the at least one first-level BVH. Further, the apparatus may calculate, for each first-level bounding box that the view frustum intersects, whether the view frustum intersects with each first-level child nod that is associated with each first-level bounding box. The apparatus may also output an indication of all of the first-level child nodes that the view frustum intersects for each of the set of first-level bounding boxes that the view frustum intersects.

A technique for performing ray tracing operations is provided. The technique includes arriving at a bounding box of a bounding volume hierarchy (“BVH”) having an orientation defined based on a platonic solid; testing a ray for intersection with the bounding box; and continuing traversal of the BVH based on results of the testing.

Systems and methods for faster BVH building that requires repeated sorting and partitioning of are described. Specific hardware circuitries are programmed to sort partitioned data and make reductions for each partition. The hardware units perform the initial sorting along a split axis and calculation of bounding box extents. The solutions presented herein improve performance of BVH builds, especially for cases where the geometry is comprised of many small BVH treelets. The most expensive processing steps in BVH construction are delegated to hardware thereby minimizing memory access latencies and increasing overall system efficiencies.

Systems and techniques are provided for accelerated ray tracing. For instance, a process can include obtaining a hierarchical acceleration data structure that includes a plurality of primitives of a scene object and obtaining a respective information value associated with each primitive included in the plurality of primitives. A sort order can be determined for two or more nodes included in a same level of the hierarchical acceleration data structure at least in part by sorting the two or more nodes based on a respective sorting parameter value determined for each respective node of the two or more nodes. Each respective sorting parameter value can be determined based on at least one information value associated with one or more primitives included in a sub-tree of each respective node of the two or more nodes. The hierarchical acceleration data structure can be traversed using the sort order.

A technique for performing a ray tracing operation is provided. The technique includes identifying triangles to be included in a compressed triangular block; storing data common to the identified triangles as common data for the compressed triangular block; and storing data unique to the identified triangle as unique data for the compressed triangle block.

Techniques for constructing a bounding volume hierarchy are disclosed that include refining a candidate box node based on a resolution to generate a plurality of cells for the candidate box node, identifying a plurality of nodes of a triangle set collection that fall within the cell, generating a plurality of candidate splits based on the plurality of nodes, selecting the candidate splits based on a selection criterion to obtain selected candidate splits, and generating child box nodes for the box node of the bounding volume hierarchy being constructed based on the selected candidate splits.

One or more rotated bounding volumes are generated for one or more nodes of a bounding volume hierarchy (BVH). Volume intersection ray tracing tests are then be performed using the rotated bounding volumes with the aim of reducing the number of calculations required relative to an original, non-rotated bounding volume. Rotated bounding volumes are selected from a plurality of candidate rotations, and selection of one of the candidate rotations are based on surface areas, such as minimum total surface areas, of bounding volumes corresponding to each of the candidate rotations. In order to minimize data storage and increase performance, a number of candidate rotations may be limited to a predetermined set of rotations.

This disclosure provides systems, devices, apparatus, and methods, including computer programs encoded on storage media, for traversing a low-resolution BVH. A processor may obtain a first indication of a low-resolution BVH that includes a set of conservative candidate nodes that are associated with corresponding internal nodes of a full-resolution BVH. The processor may traverse the low-resolution BVH by (a) determining whether a ray intersects a primitive leaf of a conservative candidate node of the set of conservative candidate nodes in response to a first determination that the ray intersects the conservative candidate node and (b) traversing an internal node of the full-resolution BVH that corresponds with the conservative candidate node in response to a second determination that the ray does not intersect the primitive leaf. The processor may output a second indication of a ray trace hit or a ray trace miss based the traversal.

In a graphics processor, optimising a bounding volume hierarchy (BVH) acceleration structure representing 3D regions of space in a modelled environment for ray tracing. The BVH is a tree with leaf nod

Apparatuses and methods for manageable segmented acceleration structures are disclosed. For example, one embodiment of an apparatus includes acceleration structure construction logic to construct an AS including a multi-level link hierarchy having different types of acceleration structure (AS) fragments, the different types of AS fragments including a first type of AS fragments having leaves, a second type of AS fragments including AS links, and a third type of AS fragments including both leaves and AS links, wherein in order to construct the AS fragment, the acceleration structure construction logic is to evaluate a plurality of primitive references, determine whether each primitive reference indicates a primitive or an AS fragment, and encode a pointer or offset directly or indirectly into a boundary volume hierarchy (BVH) of the AS fragment if the primitive reference indicates the AS fragment; and traversal hardware logic to traverse the rays through the AS.

Techniques are disclosed relating to ray tracing, e.g., in graphics processors. Ray tracing embodiments may utilize a bounding volume hierarchy (BVH) acceleration data structure (ADS) that includes a hierarchy of bounding volumes. A graphics processor may traverse the ADS, testing for intersections with bounding volumes, to determine which primitives to test for a given ray. Some nodes may be transform nodes (e.g., instance nodes) that correspond to a ray transform before further traversal. In disclosed embodiment, one or more levels below the transform node may be reverse transformed and included above the transform node. This may advantageously avoid a ray transform operation for rays that would not have hit in the first one or more levels of the transform sub-tree.

Techniques herein involve building bounding volume hierarchies for ray tracing using neural networks. Bottom-up BVH building techniques include nearest neighbor search operations and tree construction operations. The nearest neighbor search operations evaluate a set of candidate nodes that do not have any parents to identify nearest neighbor pairs and the tree construction operations “combine” the nearest neighbor pairs by generating new nodes that are parents of the nodes of the pairs. The nearest neighbor search is an expensive operation as it generally considers all possible combinations of the set to select one considered “best.” A neural network model is thus proposed herein which can perform this nearest neighbor search in a more efficient manner. Specifically, the neural network model accepts, as input, information characterizing the nodes of a set for which a search is performed and provides, as output, information characterizing the nearest neighbor pairs found for the set.

A method and system for traversing a bounding volume hierarchy (BVH) structure associated with a given 3D scene using a ray tracing algorithm are provided. The method comprises: determining an escape probability value for a given node of the BVH structure of a given ray traversing the given node without reflecting off any mesh element contained therein; propagating a ray in the given 3D scene that intersects the respective bounding volume of the given node; in response to determining that the ray is to traverse the respective bounding volume, determining whether the ray is to traverse or to reflect off an other respective bounding volume; and in response to determining that the ray is to reflect off the respective bounding volume: rendering a mesh element contained in the respective bounding volume of the given BVH node.

A method and system for traversing a bounding volume hierarchy (BVH) structure associated with a given 3D scene using a ray tracing algorithm are provided. The method comprises: determining an escape probability value for a given node of the BVH structure of a given ray traversing the given node without reflecting off any mesh element contained therein; propagating a ray in the given 3D scene that intersects the respective bounding volume of the given node; in response to determining that the ray is to traverse the respective bounding volume, determining whether the ray is to traverse or to reflect off an other respective bounding volume; and in response to determining that the ray is to reflect off the respective bounding volume: rendering a mesh element contained in the respective bounding volume of the given BVH node.

Apparatus and method for a BVH with oriented boundaries using quantized shared orientations. For example, one embodiment of an apparatus comprises: traversal hardware logic for traversing rays through a bounding volume hierarchy (BVH); and BVH construction circuitry for generating a BVH with one or more oriented bounding boxes (OBBs), wherein the BVH construction circuitry projects a geometry of one or more child nodes along one or more orientation directions to determine corresponding upper and lower bounds; wherein the traversal hardware logic comprises OBB processing logic for: projecting a ray along the one or more orientation directions;in response, determining beam-plane intersection distances to one or more near and far boundary planes corresponding to the orientation directions; and determining a hit or miss based on the beam-plane intersection distances to the near and far boundary planes.

This disclosure provides systems, devices, apparatus, and methods, including computer programs encoded on storage media, for exploiting spatial locality to speed up first-hit ray BVH traversals. A processor may generate a bounding volume hierarchy (BVH) hit map based a set of pixels, where the BVH hit map includes entries indicative of intersection information for a set of rays associated with the set of pixels, and where the BVH hit map corresponds to a BVH. The processor may select an entry from the entries of the BVH hit map based on pixel coordinate information for the set of pixels. The processor may traverse the BVH from a node of the BVH associated with the selected entry.

An implementation comprises traversing a bounding volume hierarchy for each ray of a plurality of rays concurrently using a plurality of execution items. In response to determining that a first execution item of the plurality of execution items is finished traversing the bounding volume hierarchy for a first ray of the plurality rays, the embodiment causes the first execution item to traverse the bounding volume hierarchy for a second ray of the plurality of rays while a second execution item of the plurality of execution items traverses the bounding volume hierarchy for the second ray. And the embodiment comprises initiating side-effects with the first and second execution items in an order indicated by the bounding volume hierarchy.

A graphics processor includes circuitry configured to generate a bounding volume hierarchy (BVH) data structure for a graphics scene to be rendered. The BVH includes a leaf node that includes: node data that specifies quantization frame data for quantized primitive children of the leaf node, a quantized primitive block that includes quantized vertex components of the primitive children, and a vertex residual block that includes additional vertex data for the primitive children. The vertex residual block may not include redundant data with the quantized primitive block and the quantized primitive block and vertex residual block may include, for the primitive children, sufficient data to reconstruct an original-precision representation of their vertices. The circuitry may traverse the BVH to perform ray tracing operations during render of the graphics scene, including to perform one or more ray primitive intersect tests based on the quantized primitive block and the vertex residual block.

Embodiments of the present disclosure relate to a method, an electronic device and a computer storage medium for compressing a bounding volume hierarchy, and relate to the field of information processing. According to the method, a node in a bounding volume hierarchy and a plurality of child nodes of the node are acquired; a maximum number difference between a plurality of primitives included in the plurality of child nodes is determined; if it is determined that the maximum number difference is less than or equal to a representation range of a primitive number difference field in a first compressed node format, the node and the plurality of child nodes are compressed based on the first compressed node format; and if it is determined that the maximum number difference is greater than the representation range of the primitive number difference field in the first compressed node format, the node and the plurality of child nodes are compressed based on a second compressed node format, the second compressed node format having a length greater than a length of the first compressed node format. Thus, the bounding volume hierarchy can be efficiently compressed.

Apparatus and method for box-box testing. For example, one embodiment of a processor comprises: a bounding volume hierarchy (BVH) generator to construct a BVH comprising a plurality of hierarchically arranged BVH nodes; traversal circuitry to traverse query boxes through the BVH, the traversal circuitry to read a BVH node from a top of a BVH node stack and to read a query box from a local storage or memory, the traversal circuitry further comprising: box-box testing circuitry and / or logic to compare maximum and minimum X, Y, and Z coordinates of the BVH node and the query box and to generate an overlap indication if overlap is detected for each of the X, Y, and Z dimensions; distance determination circuitry and / or logic to generate a distance value representing an extent of overlap between the BVH node and the query box; and sorting circuitry and / or logic to sort the BVH node within a set of one or more additional BVH nodes based on the distance value.

Techniques herein involve generating a bounding volume hierarchy in a fast and accurate manner. The techniques begin with a quickly built initial BVH and traverse that initial BVH in a bottom-up manner to generate a new BVH. The algorithm begins at the bottom level, setting the bottom-most primitive nodes as nodes in the new BVH and follows the initial BVH up, collecting uncombined nodes from lower levels to higher nodes. When the algorithm has collected a threshold number of such nodes at a node of the initial BVH, the algorithm builds a new subtree for that node by combining the threshold number of such nodes, and adds that new subtree to the new BVH. This algorithm is efficiently parallelizable by immediately switching from the traversal phase to the combining phase and using all work-items of a wavefront for such combining.