Techniques for conservative rasterization
    1.
    发明授权
    Techniques for conservative rasterization 有权
    保守光栅化技术

    公开(公告)号:US09324127B2

    公开(公告)日:2016-04-26

    申请号:US14454394

    申请日:2014-08-07

    CPC classification number: G06T1/20 G06T11/40 G06T17/10 G09G5/18 G09G2310/08

    Abstract: This disclosure describes a method for performing conservative rasterization in a processor comprising determining vertices of a primitive, defining edges of the primitive by determining a set of edge equations based on the determined vertices, wherein the edge equations are based on an edge shifting parameter plus an offset, determining pixels that touch the edges of the primitive using the determined edge equations, and rasterizing the primitive using the determined pixels.

    Abstract translation: 本公开描述了一种用于在处理器中执行保守光栅化的方法,包括通过基于所确定的顶点确定一组边缘方程来确定原语的边缘来定义基元的边缘,其中边缘方程基于边缘移位参数加上 使用所确定的边缘方程来确定触摸图元的边缘的像素,以及使用所确定的像素来对原图进行光栅化。

    TECHNIQUES FOR CONSERVATIVE RASTERIZATION
    2.
    发明申请
    TECHNIQUES FOR CONSERVATIVE RASTERIZATION 有权
    保守放电技术

    公开(公告)号:US20150235340A1

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

    申请号:US14454394

    申请日:2014-08-07

    CPC classification number: G06T1/20 G06T11/40 G06T17/10 G09G5/18 G09G2310/08

    Abstract: This disclosure describes a method for performing conservative rasterization in a processor comprising determining vertices of a primitive, defining edges of the primitive by determining a set of edge equations based on the determined vertices, wherein the edge equations are based on an edge shifting parameter plus an offset, determining pixels that touch the edges of the primitive using the determined edge equations, and rasterizing the primitive using the determined pixels.

    Abstract translation: 本公开描述了一种用于在处理器中执行保守光栅化的方法,包括通过基于所确定的顶点确定一组边缘方程来确定原语的边缘来定义基元的边缘,其中边缘方程基于边缘移位参数加上 使用所确定的边缘方程来确定触摸图元的边缘的像素,以及使用所确定的像素来对原图进行光栅化。

    Start node determination for tree traversal in ray tracing applications

    公开(公告)号:US09697640B2

    公开(公告)日:2017-07-04

    申请号:US14257385

    申请日:2014-04-21

    CPC classification number: G06T15/06 G06T2210/12

    Abstract: At least one processor may organize a plurality of primitives in a hierarchical data structure. The at least one processor may rasterize a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure to an off-screen render target. The at least one processor may determine a bounding volume that is intersected by a ray out of the plurality of bounding volumes. The at least one processor may determine a non-root node of the hierarchical data structure that is associated with the bounding volume as a start node in the hierarchical data structure to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine the primitive that is intersected by the ray.

    START NODE DETERMINATION FOR TREE TRAVERSAL IN RAY TRACING APPLICATIONS
    4.
    发明申请
    START NODE DETERMINATION FOR TREE TRAVERSAL IN RAY TRACING APPLICATIONS 有权
    开始RAR跟踪应用中的TREE TRASVERS的节点确定

    公开(公告)号:US20150302629A1

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

    申请号:US14257385

    申请日:2014-04-21

    CPC classification number: G06T15/06 G06T2210/12

    Abstract: At least one processor may organize a plurality of primitives in a hierarchical data structure. The at least one processor may rasterize a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure to an off-screen render target. The at least one processor may determine a bounding volume that is intersected by a ray out of the plurality of bounding volumes. The at least one processor may determine a non-root node of the hierarchical data structure that is associated with the bounding volume as a start node in the hierarchical data structure to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine the primitive that is intersected by the ray.

    Abstract translation: 至少一个处理器可以在分层数据结构中组织多个基元。 所述至少一个处理器可以将与分层数据结构的非根节点相关联的多个边界卷光栅化为离屏渲染目标。 所述至少一个处理器可以确定由所述多个边界卷中的射线相交的边界体积。 所述至少一个处理器可以确定与所述分层数据结构相关联的所述分层数据结构的非根节点作为所述分层数据结构中的起始节点,以开始遍历所述分层数据结构。 至少一个处理器可以从开始节点开始遍历分层数据结构,以确定与射线相交的原语。

Patent Agency Ranking