Binsorter triangle insertion optimization
    1.
    发明授权
    Binsorter triangle insertion optimization 有权
    Binsorter三角插入优化

    公开(公告)号:US06424345B1

    公开(公告)日:2002-07-23

    申请号:US09418685

    申请日:1999-10-14

    IPC分类号: G06T1500

    CPC分类号: G06T11/40 G06T15/005

    摘要: A method for rendering polygons in a computer graphics system in which the computer display is divided into a plurality of subregions, and the rasterization process is performed in a micro framebuffer for each subregion, rather than sending raster data for each triangle into the frame buffer. Each polygon undergoes a first stage bounding box intersection test to identify the subregions which are likely to intersect with the polygon. If the number or configuration of intersected subregions exceeds a predetermined threshold requirement, then the polygon undergoes a more precise second stage intersection test to identify which subregions are actually intersected by the polygon. If the number or configuration of intersected subregions is below the threshold requirement, then the control data for the polygon is passed on to each of the identified subregions.

    摘要翻译: 一种用于在计算机图形系统中渲染多边形的方法,其中计算机显示器被划分为多个子区域,并且在用于每个子区域的微帧缓冲器中执行光栅化处理,而不是将每个三角形的光栅数据发送到帧缓冲器中。 每个多边形经历第一阶段边界框交叉测试以识别可能与多边形相交的子区域。 如果相交子区域的数量或配置超过预定阈值要求,则多边形经历更精确的第二阶段交叉测试,以确定哪些子区域实际上被多边形相交。 如果相交子区域的数量或配置低于阈值要求,则将多边形的控制数据传递给每个所识别的子区域。