Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

132 results about "Bounding volume" patented technology

In computer graphics and computational geometry, a bounding volume for a set of objects is a closed volume that completely contains the union of the objects in the set. Bounding volumes are used to improve the efficiency of geometrical operations by using simple volumes to contain more complex objects. Normally, simpler volumes have simpler ways to test for overlap.

Neural network-based ray tracing

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.
Owner:ADVANCED MICRO DEVICES INC

Ray-Box Intersection Circuitry

Techniques are disclosed relating to ray intersection tests for ray tracing in graphics processors. In some embodiments, a ray cache stores, transformed ray direction corresponding to a transform of a ray based on its dominant direction axis. Ray intersect acceleration circuitry may determine whether a ray intersects a bounding volume of a bounding volume hierarchy (BVH) data structure. Ray-plane test circuitry may perform a set of six ray-plane tests for the bounding volume using at most four floating-point multiplication operations by four multiplier circuits. The floating-point operations may operate on the transformed ray direction components from the ray cache circuitry and coordinate information for the bounding volume. Disclosed techniques may reduce area and power consumption by avoiding multiplier circuitry for some ray-plane tests.
Owner:APPLE INC

Apparatus and method for converting compressed geometries into acceleration data structures

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.
Owner:INTEL CORP

Formation of bounding volume hierarchies

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.
Owner:IMAGINATION TECH LTD

Prism volumes for displaced subdivided triangles

To perform ray traversals of displaced micro-meshes (DMMs), a processing system includes an accelerator unit (AU). The AU is configured to first generate a DMM including one or more base triangles. The AU then generates an initial bounding volume around a first base triangle of the DMM. Further, the AU bounds one or more sides of the initial bounding volume with respective bounding volumes to produce a prism bounding volume around the base triangle. The AU is then configured to determine whether a ray intersects the prism volume bounding the first base triangle of the DMM.
Owner:ADVANCED MICRO DEVICES INC +1

Graphics processing

A graphics processor that is operable to perform ray tracing is disclosed. When it is determined that a ray intersects a volume represented by a node of a ray tracing acceleration data structure that is associated with a bounding volume primitive, the ray is not tested against the bounding volume primitive to determine whether the ray intersects the bounding volume primitive.
Owner:ARM LTD

Hierarchical occlusion perception grid infinitesimal streaming and adaptive rendering method

The invention relates to a hierarchical occlusion perception grid infinitesimal streaming transmission and adaptive rendering method, which comprises the following steps of: S1, decomposing a model into grid infinitesimal, recursively constructing a bounding volume hierarchical tree BVH from bottom to top by taking the grid infinitesimal as a leaf node, and setting a semantic error and a geometric error for each sub-node cluster; s2, acquiring camera parameters of a current frame, comparing a total screen space error with an error threshold value, if the error is smaller than the threshold value, stopping traversing, and adding the cluster node into a to-be-rendered list of the current frame; and S3, if the grid infinitesimal corresponding to the cluster node in the to-be-rendered list is not loaded to the GPU memory, sending a loading request to an asynchronous streaming manager, asynchronously loading the corresponding grid infinitesimal from the memory, and rendering a father node of the cluster node. Compared with the prior art, the method has the advantages that large-scale and high-precision model data can be rendered on the lightweight XR all-in-one machine in real time, and the like.
Owner:SHANGHAI JIAOTONG UNIV

Content generation systems and applications using octree-based spatial databases

Approaches presented herein provide for the generation and maintenance of a minimally-sized octree (or other spatial representation) for an arbitrary or dynamic dataset. An octree representation allows for efficient real-time querying of dynamic content, where such a spatial database can scale from a single machine to multiple machines. Objects in a scene can be stored to the spatial database using a set of spatial primitives. When a first object (or set of objects) in a scene is determined, an initial octree and root can be determined based at least in part upon the size and location of the object(s). An additional object may be added that is outside the existing root of the octree. A new bounding volume is generated that surrounds this new object, and the bounding volume is grown in alternating directions until the bounding volume also includes the other objects in the environment, and this new volume boundary becomes the new root of an updated octree for this environment.
Owner:NVIDIA CORP

Ray tracing hardware acceleration for supporting motion blur and moving / deforming geometry

Ray tracing hardware accelerators supporting motion blur and moving / deforming geometry are disclosed. For example, dynamic objects in an acceleration data structure are encoded with temporal and spatial information. The hardware includes circuitry that test ray intersections against moving / deforming geometry by applying such temporal and spatial information. Such circuitry accelerates the visibility sampling of moving geometry, including rigid body motion and object deformation, and its associated moving bounding volumes to a performance similar to that of the visibility sampling of static geometry.
Owner:NVIDIA CORP

Ordering of Child Node Traversal for Ray Tracing

Techniques are disclosed relating to intersection tests for ray tracing in graphics processors. In some embodiments, traversal circuitry is configured to traverse an acceleration data structure that includes hierarchically-arranged bounding volumes for at least a portion of a graphics scene, including to perform a depth-first search of the acceleration data structure for a ray. The traversal may also include, for a set of child nodes of a first node in the acceleration data structure, selecting a next node for the depth-first search according to an ordering of intersected bounding regions for the set of child nodes. The ordering may begin with a bounding volume that is closer to a mid-point of a ray being tested than one or more front bounding volumes and one or more back bounding volumes.
Owner:APPLE INC

Hardware Acceleration for Motion Blur with Ray Tracing

Techniques are disclosed relating to ray tracing and motion blur in graphics processors. In some embodiments, ray intersection accelerator circuitry is configured to perform traversal operations for an acceleration data structure (ADS) that includes hierarchical bounding volumes, where the ADS includes a first node that specifies: first coordinates of a bounding volume at a first motion blur time and second coordinates of the bounding volume at a second motion blur time. The Ray accelerator may determine a ray time interval representation indicating upper and lower bounds that represent error bounds for a quantized ray time value of a ray. Interpolation circuitry may operate on the first coordinates, the second coordinates, and the ray time interval representation to generate interpolated coordinates for the bounding volume. Box test circuitry may determine whether the ray intersected the bounding volume based on the interpolated coordinates and coordinates of the ray.
Owner:APPLE INC

Traversal and procedural shader bounds refinement

A technique for performing ray tracing operations is provided. The technique includes, traversing through a bounding volume hierarchy for a ray to arrive at a well-fit bounding volume that is associated with first node, wherein the first node is one of a traversal node or a procedural node, and wherein the well-fit bounding volume comprises geometry other than a single axis-aligned bounding box for the first node; evaluating the ray for intersection with the well-fit bounding volume; determining whether to execute a first shader program associated with the first node based on the evaluating, wherein the first shader program comprises a traversal shader program or a procedural shader program; and executing or not executing the first shader program based on the determining.
Owner:ADVANCED MICRO DEVICES INC +1

Method of Traversing a Hierarchical Acceleration Structure

A hierarchical acceleration structure for use in a ray tracing system. When generating a node for the hierarchical acceleration structure, the primitives in a particular portion of the 3D scene may be alternatively bounded by different shaped volumes. These bounding volumes or ‘bounding regions’ can be Axis Aligned Bounding Boxes (AABBs), although other bounding volumes can be used. The ray tracing system may use sets of two or more bounding volumes in a 3D scene to bound all the primitives within that portion. The choice of how to create sets of multiple bounding volumes within a portion of the 3D scene may be done by using a binary space partition (BSP). Different sets of bounding regions may present different amounts of surface area for a hypothetical ray entering the portion of the 3D scene dependent upon the expected ray direction or angle.
Owner:IMAGINATION TECH LTD

Hardware acceleration for motion blur with ray tracing

Techniques are disclosed relating to ray tracing and motion blur in graphics processors. In some embodiments, ray intersection accelerator circuitry is configured to perform traversal operations for an acceleration data structure (ADS) that includes hierarchical bounding volumes, where the ADS includes a first node that specifies: first coordinates of a bounding volume at a first motion blur time and second coordinates of the bounding volume at a second motion blur time. The Ray accelerator may determine a ray time interval representation indicating upper and lower bounds that represent error bounds for a quantized ray time value of a ray. Interpolation circuitry may operate on the first coordinates, the second coordinates, and the ray time interval representation to generate interpolated coordinates for the bounding volume. Box test circuitry may determine whether the ray intersected the bounding volume based on the interpolated coordinates and coordinates of the ray.
Owner:APPLE INC

Triangle pairing optimizer

PendingUS20240428503A1Image generation3D-image renderingAlgorithmTriangle graph
A method for grouping primitives into pairs of adjoining triangles for use in a ray tracing process. An input list of edges of triangular primitives is obtained, an edge bounding volume surface area (BVSA) and an additional edge qualifier is determined for each of the edges. The entries in the input list are sorted by edge BVSA then by edge qualifier, giving a sorted list in which the entries have a sorted order. The list is traversed in the sorted order to seek groups of matched edges within a predetermined window of list entries, each edge in a matched group having a matching edge BVSA and edge qualifier with another edge in the matched group from a different triangular primitive. When a group of matched edges is found, associated triangular primitives are designated as a cluster of adjoining primitives. The cluster of adjoining primitives are processed together as a group.
Owner:IMAGINATION TECH LTD

Discrete rotations for oriented bounding boxes based on platonic solids

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.
Owner:ADVANCED MICRO DEVICES INC

Bounding volume hierarchy leaf node compression

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.
Owner:ADVANCED MICRO DEVICES INC +1

Volume intersection using rotated bounding volumes

ActiveUS12190447B2Image generation3D-image renderingVolume intersectionAlgorithm
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.
Owner:ADVANCED MICRO DEVICES INC

Formation of bounding volume hierarchies

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
Owner:IMAGINATION TECH LTD

Triangle pairing optimizer

A method for grouping primitives into pairs of adjoining triangles for use in a ray racing process. An input list of edges of triangular primitives is obtained and an edge bounding volume surface area
Owner:IMAGINATION TECH LTD

Light ray tracing method, graphics processor, electronic equipment and storage medium

The invention discloses a ray tracing method, a graphics processor, an electronic device and a storage medium, and the method comprises the steps: obtaining batch primitive information meeting a coloring test requirement in a current node in a bounding volume hierarchical structure by a ray tracer in a process of carrying out a traversal intersection test on a ray and the bounding volume hierarchical structure; transmitting the batch primitive information and the current light ray information corresponding to the current node to a shader, so that the shader performs a coloring intersection test on the batch primitive and the current light ray; and receiving an intersection test result transmitted by the shader, and executing ray tracing operation according to the intersection test result. According to the technical scheme, the waiting time delay of information transmission between the light tracer and the shader can be reduced, and the execution efficiency of a graphic rendering task and the utilization rate of hardware resources of a graphic processor are improved.
Owner:RICUN TECH (SHANGHAI) CO LTD

Electromagnetic scattering calculation method based on heterogeneous GPU cluster

The embodiment of the invention provides an electromagnetic scattering calculation method based on a heterogeneous GPU cluster. The method is applied to the field of computational electromagnetism, and comprises the following steps: constructing a hierarchical bounding volume geometric acceleration structure of a target object and adding an edge index, and meanwhile, completely copying and distributing data of the acceleration structure to a video memory of each computational node in a heterogeneous GPU cluster; generating a random ray path starting from an emission source, modeling an electromagnetic scattering process as a ray path set in a probability space, and generating a ray direction through an importance sampling strategy; determining a static scheduling strategy for the ray batch based on the calculation cost of pre-sampling and geometric enhancement, and carrying out non-uniform distribution on task tiles according to the heterogeneous GPU calculation power; and monitoring the execution state of the heterogeneous GPU cluster in real time, and dynamically adjusting the distribution strategy of the residual ray tasks based on execution feedback. According to the method, the calculation overhead can be remarkably reduced while the calculation precision is ensured, and the efficiency and expandability of complex target electromagnetic scattering calculation are improved.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Bounding volume hierarchy with bounding volumes in prior space corresponding to subset of transform sub-tree bounds

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.
Owner:APPLE INC

Accelerating bounding volume hierarchy construction with machine learning

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.
Owner:ADVANCED MICRO DEVICES INC

Method and a system for bounding volume hierarchy approximation

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.
Owner:HUAWEI TECH CO LTD

Method and a system for bounding volume hierarchy approximation

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.
Owner:HUAWEI TECH CO LTD

Systems and methods for detecting ray intersections with displaced micro-meshes

A device that defines and uses a bounding volume for testing for ray intersections with a displaced micro-mesh. The bounding volume is indirectly based on a twisted prism composed of two triangles and three bilinear patches that bounds the displaced micro-mesh. Instead of detecting intersection with the bilinear patches directly, tetrahedrons that circumscribe the bilinear patches can be used instead. The two bases and the three tetrahedra make fourteen triangles. The device tests for potential intersection with the displaced micro-mesh by testing for an intersection with any of the fourteen triangles. Various other methods and systems are also disclosed.
Owner:ADVANCED MICRO DEVICES INC

Progressive compression of geometry for graphics processing

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.
Owner:APPLE INC