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

    公开(公告)号:US20150287234A1

    公开(公告)日:2015-10-08

    申请号:US14741121

    申请日:2015-06-16

    CPC classification number: G06T1/60 G06T15/005 G06T17/20

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

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

Patent Agency Ranking