登录
首页 » Visual C++ » scanfill

scanfill

于 2013-05-16 发布 文件大小:6694KB
0 219
下载积分: 1 下载次数: 6

代码说明:

  光栅图形学中的扫描填充算法。list AET和list* NET构成了活性边表和新边表.算法先初始化各扫描线新边表,之后对于每条扫描线更新活性边表,并且配对交点来着色。 (Raster graphics scanning fill algorithm. list AET list * NET constitute the active side of the table and side table new algorithm to initialize each scan line side table new, after each scan line update the active side of the table, and the the paired intersection of coloring.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Maths_AverageFilter
    适合初学者的dsp图像程序,均值滤波程序、代码(Program for beginners DSP image, average filtering program, code)
    2015-05-20 16:41:12下载
    积分:1
  • DWT
    e-book for DWT method for fusion image
    2015-05-05 18:30:14下载
    积分:1
  • SIFT_RANSAC_MATCH
    利用GPU加速的SIFT算法,实现影像匹配,并利用RANSAC进行粗差的剔除(GPU-accelerated use SIFT algorithm to achieve image matching, and use RANSAC removing coarse poor)
    2021-04-09 19:49:14下载
    积分:1
  • 2FFT
    使用二維的傅立業轉換,在以反傅立業的方式,將結果以影像話方式呈現。(Industry use of two-dimensional Fourier transformation, anti-Fu Li industry in the way of results, then the way to show images.)
    2009-04-29 13:50:30下载
    积分:1
  • ex2
    用画笔绘制圆角矩形,椭圆,饼形,并用不同颜色画刷进行填充。(Draw a rounded rectangle, ellipse, pie with a brush, and brush with a different color fill.)
    2013-12-07 23:42:44下载
    积分:1
  • LD24_SlimeWorld_ProjectFile
    好东西,下下来看就知道了好东西,下下来看就知道了(Good things, under the terms of the next good thing to know, under the circumstances of view to know)
    2013-11-18 08:52:20下载
    积分:1
  • barcode
    code 128 条码生成与译码演示 code 128 条码生成与译码演示(code 128 barcode generation and decoding demo code 128 barcode generation and decoding demo)
    2009-01-02 15:32:57下载
    积分:1
  • ffdct
    这是DCT的改进算法,可以提高DCT算法的执行速度。(This is the DCT of the improved algorithm can improve the execution speed DCT algorithms.)
    2009-09-15 12:51:41下载
    积分:1
  • GanssianBlur
    平台基于visual studio2015,使用opencv函数实现高斯滤波,进行图像处理(gaussian blur based on opencv)
    2020-06-20 05:40:01下载
    积分:1
  • area
    说明:  计算凸包面积,点集Q的凸包是指一个最小凸多边形,满足Q中的点或者在多边形边上或者在其内。(Calculate convex hull area。The convex hull of point set Q is a minimum convex polygon, to meet the Q of the point or polygon or in its inside edge)
    2010-04-11 01:20:14下载
    积分:1
  • 696518资源总数
  • 106222会员总数
  • 14今日下载