TECHNIQUES FOR EFFICIENT GPU TRIANGLE LIST ADJACENCY DETECTION AND HANDLING
    4.
    发明申请
    TECHNIQUES FOR EFFICIENT GPU TRIANGLE LIST ADJACENCY DETECTION AND HANDLING 有权
    有效的GPU三角形列表检测和处理技术

    公开(公告)号:US20140085302A1

    公开(公告)日:2014-03-27

    申请号:US13627699

    申请日:2012-09-26

    IPC分类号: G06T17/10

    CPC分类号: G06T1/60 G06T15/005 G06T17/20

    摘要: An apparatus may include a memory to store a set of triangle vertices in a triangle, a processor circuit coupled to the memory and a cache to cache a set of triangle vertex indices corresponding to triangle vertices most recently transmitted through a graphics pipeline. The apparatus may also include an autostrip vertex processing component operative on the processor circuit to receive from the memory the set of triangle vertices, compare an index for each vertex of the set of triangle vertices to determine matches to the set of cached triangle vertex indices, and shift a single vertex index into the cache, the single vertex index corresponding to a vertex miss in which a given vertex of the set of triangle vertices does not match any vertex index of the set of cached triangle vertex indices when exactly two matches to the set of cached triangle vertex indices are found.

    摘要翻译: 装置可以包括存储器,用于存储三角形中的一组三角形顶点,耦合到存储器的处理器电路和高速缓存,以缓存对应于最近通过图形管线传输的三角形顶点的一组三角形顶点索引。 该装置还可以包括在处理器电路上操作以从存储器接收该组三角形顶点的自动条带顶点处理组件,比较该组三角形顶点的每个顶点的索引,以确定与该组缓存的三角形顶点索引的匹配, 并将单个顶点索引移动到高速缓存中,对应于顶点未​​命中的单个顶点索引,其中三角形顶点集合的给定顶点与该组高速缓存的三角形顶点索引的任何顶点索引不匹配,当恰好两个匹配时 找到一组缓存的三角形顶点索引。

    EFFICIENT TESSELLATION CACHE
    7.
    发明申请
    EFFICIENT TESSELLATION CACHE 审中-公开
    高效的缓存缓存

    公开(公告)号:US20160093102A1

    公开(公告)日:2016-03-31

    申请号:US14495926

    申请日:2014-09-25

    申请人: PETER L. DOYLE

    发明人: PETER L. DOYLE

    摘要: Systems and methods may provide for conducting a region determination of whether one or more domain points associated with a tessellated patch are shared between multiple region sets of the tessellated patch. If the one or more domain points are not shared between multiple region sets of the tessellated patch, an intra-region cache may be automatically interrogated for non-shared shading data. If the one or more domain points are shared between multiple region sets of the tessellated patch, an inter-region cache may be automatically interrogated for shared shading data. In one example, one or more references to the shared shading data is generated and associated with the one or more domain points when cache hits occur in the inter-region cache.

    摘要翻译: 系统和方法可以提供区域确定与镶嵌补丁相关联的一个或多个域点是否在镶嵌补丁的多个区域集合之间共享。 如果一个或多个域点在分块补丁的多个区域集之间不共享,则区域内高速缓存可以被自动询问用于非共享着色数据。 如果一个或多个域点在镶嵌补丁的多个区域集合之间共享,则可以自动询问区域间高速缓存以用于共享着色数据。 在一个示例中,当在区域间高速缓存中出现高速缓存命中时,生成对共享着色数据的一个或多个引用并与一个或多个域点相关联。