Intel Corporation

Oliver A Heim

Stephen Junkins

Carl S Marshall

Charles M Forest

Lance Raymond Alba

Sanjeev N Trika

Adam T Lake

Rahul P Sathe

Shankar N Swamy

Apparatus, systems and methods for optimized frustum clipping via cached clip vertices are disclosed. For example, a method is disclosed, the method including generating a clip vertex for a leading edge of a triangle of a triangle strip or fan, indicating that the leading edge is shared with an adjacent triangle of the triangle strip or fan, and in response to the indication, using the clip vertex as a clip vertex of a trailing edge of the adjacent triangle in the triangle strip or fan. Other implementations are disclosed.

Optimized frustum clipping via cached clip vertices

A method is disclosed. The method includes receiving a first polygon, receiving a second polygon, calculating a vector joining a centroid of the first polygon and a centroid of the second polygon, retrieving vertices of each polygon that are farthest from the other polygon in the direction of the vector towards the other polygon, performing a view frustrum from each vertex retrieved for the first polygon to the centroid of the first polygon, performing a clipping operation on the second polygon and determining if the second polygon intersects the view frustrum of one or more of the vertices of the first polygon.

Real-time collision detection using clipping

Embodiments include storing graphics instructions at addresses in a memory in an original order, and storing in the memory pointers associated with each instruction pointing to the addresses of the instructions in the original order. A first pointer associated with a first graphics instruction may then be moved from pointing to a first address of the first graphics instruction to point to a second address of a second graphics instruction. Likewise, a second pointer associated with the second graphics instruction may be moved from pointing to the second address to point to the first address by accessing the first pointer before moving the first pointer to determine that the second pointer is to point to the first address (e.g., the address the first instruction points to before being moved). Afterwards, the instructions may be re-ordered into an optimized order for compiling, by switching them to different addresses according to the pointers.

Memory layout for re-ordering instructions using pointers

Various methods, apparatuses, and systems are described in which subdivided polygons are derived from a first polygon. Bin assignments of subdivided polygons derived from a first polygon may be stored. One or more reference coordinate points associated with coordinates of the first polygon may be stored. One or more reference coordinate points associated with the coordinates of the first polygon on a subsequent frame may be compared to the stored one or more reference coordinate points from a previous frame. The bin assignments for the corresponding subdivided polygons for the subsequent frame may be reused if the results of the comparison are within a preset threshold quantity.

Methods and apparatuses for a polygon binning process for rendering

Detecting a collision of a three-dimensional model from three-dimensional data defining a bone includes obtaining a bounding volume for the bone, detecting a collision of the three-dimensional model with a second three-dimensional model using the bounding volume, and applying a collision response only to a colliding area of the three-dimensional model and the second-three-dimensional model.

Detecting collisions of three-dimensional models

Updating a spatial partitioning data structure during run-time in an efficient manner includes several pre-processing steps. Pre-processing includes generating a first spatial partitioning data structure for a model at a first resolution, generating a second spatial partitioning data structure for the model at a second resolution, analyzing the first and second spatial partitioning data structures to identify differences between spatial partitioning of the model at the first and second resolutions, and storing the differences in a spatial partitioning update data structure. This pre-processing may be repeated for one or more pairs of successive resolutions of the model. Subsequently, during run-time, the model's resolution may be changed from the first resolution to the second resolution. In response, a spatial partitioning data structure corresponding to the first resolution may be updated using the spatial partitioning update data structure to reflect the change in resolution of the model.

Multi-resolution spatial partitioning

Methods and apparatus for expediting detection of collision between any of N objects are disclosed. When a determination is made that a plurality of the N objects are one of (a) located in a plane and (b) collinear along a line parallel to an axis of a first coordinate system; one example method selects a second coordinate system wherein less than the plurality of the N objects lie in any plane of the second coordinate system; and performs a sweep and prune process on the N objects using the second coordinate system. Another example method responds to the determination by performing a sweep and prune process on the N objects while ignoring any set of objects having more than a predetermined number of members.

Methods and apparatus for expediting detecting collision between any of N objects

Binning polygons in a three-dimensional graphics system includes constructing a first bounding box around a first-level polygon, the first bounding box including tiles that contain the first-level polygon, subdividing the first-level polygon into second-level polygons if the first bounding box exceeds a predetermined size, and constructing bounding boxes around each second-level polygon. The second bounding box includes fewer tiles than the first bounding box.

Polygon binning process for tile-based rendering

Processing a scene graph includes applying view frustrum culling to sort models of the scene graph into first and second lists of models, the first list comprising models at least one of within a view frustrum and intersecting with the view frustrum, the second list comprising models outside of the view frustrum, and applying a first selected collision detection process to pairs of models of the first list. The method further includes applying a second selected collision detection process to pairs of models of the second list. In some embodiments, the first collision detection process is more computationally intensive than the second collision detection process.

Growing community of inventors

Cameron Park, CA, United States of America

Oliver A Heim