会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • Computer program product for utilizing fast polygon fill routines in a
graphics display system
    • 用于在图形显示系统中利用快速多边形填充程序的计算机程序产品
    • US5710578A
    • 1998-01-20
    • US521858
    • 1990-05-09
    • Gary Michael BeauregardLarry Keith LoucksKhoa Dang NguyenRobert John Urquhart
    • Gary Michael BeauregardLarry Keith LoucksKhoa Dang NguyenRobert John Urquhart
    • G06T11/40
    • G06T11/40
    • Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second polygon fill algorithm stores both a minimum value and maximum value for each scan line of the polygon for each line of the polygon. A fill line is then drawn from the least minimum value to the greatest maximum value for each scan line of the polygon.
    • 提出了两个多边形填充算法,用于在图形显示器上填充多边形。 第一个多边形填充算法填充严格凸的多边形。 第二个多边形填充算法比第一个多边形填充算法填充了更大的多边形类型,其包括在x方向上是凹的多边形,以及具有交叉线的多边形。 第一个多边形填充算法通过测试一致的转向方向,并通过在y方向测试一次,来测试多边形的严格凸度。 然后,第一多边形填充算法存储由多边形的每个扫描线由Bresenham算法选择的像素的最大值和最小值。 填充线从具有最小值的像素被绘制成具有针对多边形的每个扫描线的最大值的像素。 第二个多边形填充算法测试多边形,以确保可以为多边形的每条扫描线填充一条唯一的填充线。 第二个多边形填充算法存储多边形的每一行的多边形的每个扫描行的最小值和最大值。 然后,从多边形的每个扫描线的最小值到最大值的填充线。