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

Abstract: In one embodiment, the present invention includes a method for receiving geometry data corresponding to a plurality of polygons of a scene, calculating a luminosity metric for each polygon, and subdividing a polygon into multiple polygons if the luminosity metric is greater than a threshold level. Other embodiments are described and claimed.

Abstract: In one embodiment, the present invention includes a method for receiving vertex data corresponding to a surface of an image, performing a discrete Fourier transform (DFT) on the vertex data to obtain a frequency response, zero padding the frequency response to obtain zero padded frequency response data, and performing an inverse DFT (IDFT) on the zero padded frequency response data to obtain modified vertex data including the vertex data and additional vertex data corresponding to the surface. Other embodiments are described and claimed.

Abstract: A method is disclosed. The method includes receiving a first polygon, receiving a second polygon, determining a first distance corresponding to a distance from a first origin of the first polygon to a vertex of the second polygon, the origin of the first polygon and the vertex of the second polygon defining a direction vector, determining, along the direction vector a second distance corresponding to a distance from the first origin of the first polygon to a face of the first polygon; and detecting a collision between the first and second polygons if the second distance is greater than or equal to the first distance.

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

Abstract: Apparatus, systems and methods for real-time, multi-resolution 3D collision detection using cube maps are disclosed. For example, a method is disclosed including receiving a first polygon, receiving a second polygon and then using a texture map stored in memory to detect collisions between the first and second polygons. Other implementations are also disclosed.