公开(公告)号：US07928993B2

公开(公告)日：2011-04-19

申请号：US11495366

申请日：2006-07-28

申请人： Rahul P. Sathe ,  Adam T. Lake

发明人： Rahul P. Sathe ,  Adam T. Lake

IPC分类号： G09G5/00 ,  G06T15/00

CPC分类号： G06T17/20 ,  Y10S345/958

摘要： 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.

摘要翻译： 公开了用于使用立体图的实时多分辨率3D碰撞检测的装置，系统和方法。 例如，公开了一种方法，包括接收第一多边形，接收第二多边形，然后使用存储在存储器中的纹理图来检测第一和第二多边形之间的碰撞。 还公开了其他实施方式。

公开(公告)号：US07737997B2

公开(公告)日：2010-06-15

申请号：US11647657

申请日：2006-12-28

申请人： Rahul P. Sathe ,  Adam T. Lake

发明人： Rahul P. Sathe ,  Adam T. Lake

IPC分类号： G09G5/00 ,  G06T15/00

CPC分类号： G06T17/00

摘要： 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.

摘要翻译： 公开了一种方法。 该方法包括接收第一多边形，接收第二多边形，确定对应于从第一多边形的第一原点到第二多边形的顶点的距离的第一距离，第一多边形的原点和第二多边形的顶点 定义方向向量，沿着所述方向矢量确定对应于从所述第一多边形的所述第一原点到所述第一多边形的面的距离的第二距离; 以及如果所述第二距离大于或等于所述第一距离，则检测所述第一和第二多边形之间的碰撞。

公开(公告)号：US20090033659A1

公开(公告)日：2009-02-05

申请号：US11888158

申请日：2007-07-31

申请人： Adam T. Lake ,  Rahul P. Sathe ,  David J. Bookout

发明人： Adam T. Lake ,  Rahul P. Sathe ,  David J. Bookout

IPC分类号： G06T15/30

CPC分类号： G06T5/50

摘要： 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.

摘要翻译： 在一个实施例中，本发明包括用于接收对应于场景的多个多边形的几何数据的方法，计算每个多边形的亮度度量，以及如果亮度度量大于阈值水平则将多边形细分为多个多边形。 描述和要求保护其他实施例。

公开(公告)号：US20080158225A1

公开(公告)日：2008-07-03

申请号：US11647657

申请日：2006-12-28

申请人： Rahul P. Sathe ,  Adam T. Lake

发明人： Rahul P. Sathe ,  Adam T. Lake

IPC分类号： G06T15/00

CPC分类号： G06T17/00

摘要： 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.

摘要翻译： 公开了一种方法。 该方法包括接收第一多边形，接收第二多边形，确定对应于从第一多边形的第一原点到第二多边形的顶点的距离的第一距离，第一多边形的原点和第二多边形的顶点 定义方向向量，沿着所述方向矢量确定对应于从所述第一多边形的所述第一原点到所述第一多边形的面的距离的第二距离; 以及如果所述第二距离大于或等于所述第一距离，则检测所述第一和第二多边形之间的碰撞。

公开(公告)号：US20080024491A1

公开(公告)日：2008-01-31

申请号：US11495366

申请日：2006-07-28

申请人： Rahul P. Sathe ,  Adam T. Lake

发明人： Rahul P. Sathe ,  Adam T. Lake

IPC分类号： G06T15/40

CPC分类号： G06T17/20 ,  Y10S345/958

摘要： 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.

摘要翻译： 公开了用于使用立体图的实时多分辨率3D碰撞检测的装置，系统和方法。 例如，公开了一种方法，包括接收第一多边形，接收第二多边形，然后使用存储在存储器中的纹理图来检测第一和第二多边形之间的碰撞。 还公开了其他实施方式。

公开(公告)号：US20140198120A1

公开(公告)日：2014-07-17

申请号：US13992966

申请日：2011-12-30

申请人： Rahul P. Sathe ,  Tim Foley

发明人： Rahul P. Sathe ,  Tim Foley

IPC分类号： G06T5/00

CPC分类号： G06T15/005 ,  G06T1/60 ,  G06T17/20

摘要： In accordance with some embodiments, domain shader and/or tessellator operations can be eliminated when they are redundant. By using a corner cache, a check can determine whether a given corner, be it a vertex or a quadrilateral corner, has already been evaluated in the domain shader and/or tessellator and if so, the result of the previous operation can be reused instead of performing unnecessary invocations that may increase power consumption or reduce speed.

摘要翻译： 根据一些实施例，当它们是冗余时，可以消除域着色器和/或细分器操作。 通过使用角落缓存，检查可以确定在域着色器和/或细分器中是否已经评估了一个给定的角点（无论是顶点还是四边形角），如果是，则可以重新使用先前操作的结果 执行可能增加功耗或降低速度的不必要的调用。

公开(公告)号：US08482560B2

公开(公告)日：2013-07-09

申请号：US12387187

申请日：2009-04-29

申请人： Rahul P. Sathe ,  Paul A. Rosen

发明人： Rahul P. Sathe ,  Paul A. Rosen

IPC分类号： G06T15/00

CPC分类号： G06T17/20

摘要： In some embodiments, the intervals and the triangulation of an inner tessellation of a patch may be pre-computed. Even factor tessellations are arranged in a co-centric manner so that lower number factors are inside tessellations with higher number factors. Similarly, odd factor tessellations are arranged in a co-centric manner so that lower number factors are inside tessellations with higher number factors. Domain points of even factor tessellations are stored in a first table whereas domain points of odd factor tessellations are stored in a second table. At run time, the pre-computed values may be looked up for the applicable edge level of detail.

摘要翻译： 在一些实施例中，可以预先计算贴片的内部细分的间隔和三角测量。 偶数因子镶嵌以共同中心的方式进行布置，因此较小的数字因子在较高数量因子的细分之内。 类似地，奇数因子分块以共同中心的方式排列，使得较低数量因子在具有较高数量因子的细分内。 偶数因子细分的域点存储在第一表中，而奇数因子细分的域点存储在第二表中。 在运行时，可以查找预先计算的值以获得适用的边缘细节级别。

公开(公告)号：US07580035B2

公开(公告)日：2009-08-25

申请号：US11648484

申请日：2006-12-28

申请人： Rahul P. Sathe ,  Oliver Heim

发明人： Rahul P. Sathe ,  Oliver Heim

IPC分类号： G06T15/00

CPC分类号： G06T15/30 ,  G06T7/60 ,  G06T15/005 ,  G06T19/00 ,  G06T2200/28 ,  G06T2210/21

摘要： 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.

摘要翻译： 公开了一种方法。 该方法包括接收第一多边形，接收第二多边形，计算连接第一多边形的质心和第二多边形的质心的向量，从矢量方向检索距离另一多边形最远的每个多边形的顶点 另一个多边形，从针对所述第一多边形检索的每个顶点到所述第一多边形的质心执行视角，对所述第二多边形执行裁剪操作，以及确定所述第二多边形是否与所述第一多边形的一个或多个顶点的视点 第一个多边形。

公开(公告)号：US09984490B2

公开(公告)日：2018-05-29

申请号：US14737302

申请日：2015-06-11

申请人： Bimal Poddar ,  Prasoonkumar Surti ,  Rahul P. Sathe

发明人： Bimal Poddar ,  Prasoonkumar Surti ,  Rahul P. Sathe

IPC分类号： G06T15/00 ,  G06T1/60 ,  G06T15/04 ,  G06T15/50 ,  G06T19/20

CPC分类号： G06T15/005 ,  G06T1/60 ,  G06T15/04 ,  G06T15/506 ,  G06T19/20 ,  G06T2200/04 ,  G06T2200/28 ,  G06T2210/62

摘要： Embodiments provide for a graphics processing apparatus comprising render logic to detect rendering operations that will result in framebuffer having the same data as the initial clear color value and morphing such rendering operations to optimizations that are typically done for initial clearing of the framebuffer.

公开(公告)号：US20170124757A1

公开(公告)日：2017-05-04

申请号：US14925325

申请日：2015-10-28

申请人： Rahul P. Sathe ,  Bimal Poddar ,  Jon N. Hasselgren

发明人： Rahul P. Sathe ,  Bimal Poddar ,  Jon N. Hasselgren

IPC分类号： G06T15/80 ,  G06T7/00 ,  G06K9/46

CPC分类号： G06T15/80 ,  G06K9/4604 ,  G06K9/4671 ,  G06K2009/4666 ,  G06T15/005 ,  G06T15/04 ,  G06T2200/04 ,  G06T2200/28 ,  G06T2210/36 ,  G06T2215/16

摘要： The power consumption of processor-based devices may be reduced by reducing the consumption of power during graphics processing. In some embodiments, the precision of pixel shading in parts of images where artifacts are less objectionable may be reduced. For example, in areas the user is not directly looking at, precision may be reduced to save power. At the same time, because a person is not focusing on those regions, even if usually perceptible artifacts occur because of the reduced precision, an overall pleasing depiction may be achieved.