专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20170178277A1 SPECIALIZED CODE PATHS IN GPU PROCESSING 审中-公开
公开(公告)号：US20170178277A1
公开(公告)日：2017-06-22
申请号：US15089270
申请日：2016-04-01
申请人： SAURABH SHARMA , ABHISHEK VENKATESH , TRAVIS T. SCHLUESSLER , THOMAS F. RAOUX , RAHUL P. SATHE , JON HASSELGREN
发明人： SAURABH SHARMA , ABHISHEK VENKATESH , TRAVIS T. SCHLUESSLER , THOMAS F. RAOUX , RAHUL P. SATHE , JON HASSELGREN
IPC分类号： G06T1/20 , G06T15/00
CPC分类号： G06T1/20 , G06F8/41 , G06F9/38 , G06T15/005
摘要： Techniques to improve graphics processing unit (GPU) performance by introducing specialized code paths to process frequent common values are described. A shader compiler can determine instruction that, during operation, may output a common value and can introduce an enhanced shader instruction branch to process the common value to reduce overall computational requirements to execute the shader.

2. 发明申请

US20140198120A1 Reducing the Domain Shader/Tessellatorinvocations 有权
标题翻译：减少领域着色器/ Tessellatorinvocations
公开(公告)号：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.
摘要翻译：根据一些实施例，当它们是冗余时，可以消除域着色器和/或细分器操作。通过使用角落缓存，检查可以确定在域着色器和/或细分器中是否已经评估了一个给定的角点（无论是顶点还是四边形角），如果是，则可以重新使用先前操作的结果执行可能增加功耗或降低速度的不必要的调用。

3. 发明授权

US08482560B2 Image forming techniques 有权
标题翻译：图像形成技术
公开(公告)号：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.
摘要翻译：在一些实施例中，可以预先计算贴片的内部细分的间隔和三角测量。偶数因子镶嵌以共同中心的方式进行布置，因此较小的数字因子在较高数量因子的细分之内。类似地，奇数因子分块以共同中心的方式排列，使得较低数量因子在具有较高数量因子的细分内。偶数因子细分的域点存储在第一表中，而奇数因子细分的域点存储在第二表中。在运行时，可以查找预先计算的值以获得适用的边缘细节级别。

4. 发明授权

US07580035B2 Real-time collision detection using clipping 失效
标题翻译：实时碰撞检测使用剪辑
公开(公告)号：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.
摘要翻译：公开了一种方法。该方法包括接收第一多边形，接收第二多边形，计算连接第一多边形的质心和第二多边形的质心的向量，从矢量方向检索距离另一多边形最远的每个多边形的顶点另一个多边形，从针对所述第一多边形检索的每个顶点到所述第一多边形的质心执行视角，对所述第二多边形执行裁剪操作，以及确定所述第二多边形是否与所述第一多边形的一个或多个顶点的视点第一个多边形。

5. 发明申请

US20160364845A1 PIXEL MERGE UNIT EFFICIENCY BY IDENTIFYING SILHOUETTE PIXELS 审中-公开
标题翻译：通过识别SILHOUETTE像素的像素合并单元效率
公开(公告)号：US20160364845A1
公开(公告)日：2016-12-15
申请号：US14737128
申请日：2015-06-11
申请人： Rahul P. Sathe , Tomas G. Akenine-Moller
发明人： Rahul P. Sathe , Tomas G. Akenine-Moller
IPC分类号： G06T5/00 , G06T1/60 , G06T7/00 , G06T1/20
CPC分类号： G06T5/002 , G06T1/20 , G06T1/60 , G06T15/005 , G06T2200/12 , G06T2207/20192
摘要： In one embodiment, efficiency of a pixel merge unit of a graphics pipeline is increased by identifying a silhouette edge of an input primitive and bypassing the pixel merge unit for fragments associated with the silhouette edge. Identifying partially covered fragments along the silhouette edge and preventing those fragments from entering the pixel merge unit allows existing fragments within the pixel merge unit to reside within the pixel merge unit for a longer period before getting evicted. The additional residency grants fragments additional time to wait for neighboring fragments to arrive, which, in turn, increases the merge rate for fragments that are eligible to be merged.
摘要翻译：在一个实施例中，通过识别输入图元的轮廓边缘并绕过与轮廓边缘相关联的碎片的像素合并单元来增加图形流水线的像素合并单元的效率。沿着轮廓边缘识别部分覆盖的片段并且防止这些片段进入像素合并单元允许像素合并单元内的现有片段在被驱逐之前更长时间驻留在像素合并单元内。额外的居留许可片段增加了等待相邻片段到达的时间，这又增加了有资格合并的片段的合并率。

6. 发明申请

US20150091913A1 TECHNIQUES AND ARCHITECTURE FOR IMPROVED VERTEX PROCESSING 有权
标题翻译：改进VERTEX加工的技术和架构
公开(公告)号：US20150091913A1
公开(公告)日：2015-04-02
申请号：US14039732
申请日：2013-09-27
申请人： RAHUL P. SATHE , TIM FOLEY
发明人： RAHUL P. SATHE , TIM FOLEY
IPC分类号： G06T1/20
CPC分类号： G06T15/005 , G06T1/60 , G06T2200/28
摘要： An apparatus may include an index buffer to store an index stream having a multiplicity of index entries corresponding to vertices of a mesh and a vertex cache to store a multiplicity of processed vertices of the mesh. The apparatus may further include a processor circuit, and a vertex manager for execution on the processor circuit to read a reference bitstream comprising a multiplicity of bitstream entries, each bitstream entry corresponding to an index entry of the index stream, and to remove a processed vertex from the vertex cache when a value of the reference bitstream entry corresponding to the processed vertex is equal to a defined value.
摘要翻译：设备可以包括索引缓冲器，用于存储索引流，该索引流具有对应于网格顶点和顶点高速缓存的多个索引条目，以存储网格的多个经处理的顶点。该装置还可以包括处理器电路和顶点管理器，用于在处理器电路上执行以读取包括多个比特流条目的参考比特流，每个比特流条目对应于索引流的索引条目，并且移除经处理的顶点当与所处理的顶点相对应的参考比特流条目的值等于定义的值时，从顶点高速缓存。

7. 发明申请

US20130257891A1 Post Tesellation Edge Cache 有权
标题翻译：贴子边缘缓存
公开(公告)号：US20130257891A1
公开(公告)日：2013-10-03
申请号：US13628247
申请日：2012-09-27
申请人： Rahul P. Sathe , Tim Foley , Karthik Vaidyanathan
发明人： Rahul P. Sathe , Tim Foley , Karthik Vaidyanathan
IPC分类号： G09G5/02
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.
摘要翻译：根据一些实施例，当它们是冗余时，可以消除域着色器和/或细分器操作。通过使用角落缓存，检查可以确定在域着色器和/或细分器中是否已经评估了一个给定的角点（无论是顶点还是四边形角），如果是，则可以重新使用先前操作的结果执行可能增加功耗或降低速度的不必要的调用。

8. 发明申请

US20110216068A1 Edge processing techniques 审中-公开
标题翻译：边缘处理技术
公开(公告)号：US20110216068A1
公开(公告)日：2011-09-08
申请号：US12660956
申请日：2010-03-08
申请人： Rahul P. Sathe
发明人： Rahul P. Sathe
IPC分类号： G06T11/20 , G06T1/20
CPC分类号： G06T17/20
摘要： In some embodiments, an edge cache data table for edges shared by two or more geometrically contiguous patches is generated. An identification value is assigned for each patch. When a first patch has a common edge with a second patch, a unique identification value is generated for an entry in the table based on identification values of the two patches with a common edge. Attributes of a common edge are stored in the entry in the table associated with the unique identification value. When the common edge is to be evaluated for the second patch, the edge can be read from the table in reverse order.
摘要翻译：在一些实施例中，生成用于由两个或更多个几何连续的块共享的边缘的边缘高速缓存数据表。为每个补丁分配一个识别值。当第一补丁与第二补丁具有公共边缘时，基于具有公共边缘的两个补丁的标识值，为表中的条目生成唯一的标识值。公共边缘的属性存储在与唯一标识值相关联的表中的条目中。当要评估第二个补丁的公共边缘时，可以从表中以相反的顺序读取边。

9. 发明申请

US20100158388A1 Hardware accelerated silhouette detection 有权
标题翻译：硬件加速轮廓检测
公开(公告)号：US20100158388A1
公开(公告)日：2010-06-24
申请号：US12316984
申请日：2008-12-18
申请人： David Bookout , Rahul P. Sathe
发明人： David Bookout , Rahul P. Sathe
IPC分类号： G06K9/48 , G06F15/00
CPC分类号： G06T15/02 , G06T15/10
摘要： Disclosed herein are approaches for detecting and/or generating silhouettes, in graphics processing applications, of objects (e.g., convex objects such as polyhedrons).
摘要翻译：这里公开了用于在图形处理应用中检测和/或生成对象（例如，诸如多面体之类的凸起对象）的轮廓的方法。

10. 发明授权

US07737997B2 Collision detection of concave bodies using art gallery problem and cube maps 失效
标题翻译：使用艺术画廊问题和立方体地图碰撞检测凹体
公开(公告)号：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.
摘要翻译：公开了一种方法。该方法包括接收第一多边形，接收第二多边形，确定对应于从第一多边形的第一原点到第二多边形的顶点的距离的第一距离，第一多边形的原点和第二多边形的顶点定义方向向量，沿着所述方向矢量确定对应于从所述第一多边形的所述第一原点到所述第一多边形的面的距离的第二距离; 以及如果所述第二距离大于或等于所述第一距离，则检测所述第一和第二多边形之间的碰撞。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式