Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Detecting a collision of a three-dimensional model comprised of 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.

Abstract: 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.