搜索资源列表
zz
- 采用种子法实现图形的填充，很实用，visual stadio 2008环境下运行良好。调试成功-Graphic method to achieve by seed filling, very practical, visual stadio 2008 environment running well. Successful commissioning
basic-graph-generation
- 一个图形生成MFC系统，有计算机图形学的基本图形绘制算法，包括直线的三种（DDA，中点，Bresenham），圆的两种（中点，Bresenham），椭圆（中点）及区域填充（多边形扫描线，种子扫描）-MFC system to generate a graph, with the basic graphics computer graphics rendering algorithms, including three straight (DDA, the mid-point, Bresenham
Filling-algorithm
- 不规则区域的填充算法实验 描述：将坐标系网格在屏幕上画出来，每个像素点占据一个格点，用一个小实心圆圈表示。 用鼠标左键绘制不规则区域的边界。 选择种子点，每个象素的出栈或入栈过程要显示出来，之后点击鼠标右键可填充封闭区域-Irregular area filling algorithm of the experiment Descr iption: will coordinate grid on the screen painting out, each pixel
DDA_algm
- 本代码包含以下算法的演示： 直线：DDA算法生成直线，中点算法生成直线，Bresenham算法生成直线。 圆：中点画圆，Bresenham画圆。 椭圆：中点画椭圆。 区域填充：多边形扫描线填充，种子扫描线填充。-This code contains a demonstration of the following algorithm: Direct Line: DDA algorithm to generate a straight line, the midpoint al
JxpFillpolygon
- 多边形，剪裁，种子法填充，改进划线的方法-Polygon, cutting, Seed Law to fill, improve the method of drawing a line.
MFCWORK2_FILL
- 对一个不规则的区域进行填充，采用种子算法进行填充。是计算机图形学的一个经典例题。-Populated area of an irregular filled seeds algorithms. Is a classic example of computer graphics.
PolygpnFill
- 基于c语言的利用种子点四连通方法填充图形的源程序-Filled four connectivity method based on the use of seed points c language graphics source
cgMLlineDemo
- 实现区域填充，种子扫描算法和画线扫描算法，以及填充图案的不同识别-Different area fills, seeds scanning algorithms and draw a line scan algorithm, as well as fill pattern identification
zhongzicircle
- 利用计算机图形学里的种子算法以及画圆的算法，实现已知半径和颜色的圆外轮廓以及内部的填充。-The use of the seed algorithm computer graphics circle algorithm, known radius and color outside the circle outline and internal padding.
seed1(Seed-points-filling)
- 采用c#语言开发的种子点填充算法，功能还是很强大的-C# language development of seed points filling algorithm, the function is very powerful
dda_line2007
- 详细说明：DAA画线，这个是我计算机图形学的实验的源代码, 包括中点画线 画圆,Bresenham 画线 画圆, 种子扫描填充区域, 三角形图形基本3种变换--DAA painting lines, this is my experimental computer graphics source code, including stipple line drawcircle, Bresenham Line drawcircle, seed filling scanning region, thr
test
- opencv 实现图形填充，即将符合四连通或八连通定义的区域内的一点（常称为种子点）赋予给定颜色，然后将这种颜色扩展到整个区域的过程。-opencv graphics fill the area to be in line with the definition of four or eight connectivity connectivity point process (often referred to as seed points) giving a given color, this
stack_fill
- 使用压入栈种子点填充算法进行区域填充，使用MFC框架实现-Using the stack seeds filling area filling algorithm, using the MFC framework to achieve
Draw
- 实现了基本的DDA直线、中点直线、Bresenham直线算法，实现中点画圆，能画多边形，能进行递归种子，扫面直线填充，能改变颜色和画笔大小。-DDA to achieve the basic line, the midpoint of a straight line, Bresenham linear algorithm, the midpoint of the circle, to draw a polygon, the seeds can be recursive, linear sweep
Seed-area-filling
- 此程序为种子区域填充算法，运行时需要加载gl/glut.h-This program area for seed filling algorithm, the runtime needs to load gl/glut.h
seeds_fill
- 使用MATLAB软件，对显著图提取感兴趣的种子点坐标，并对其进行填充。-seeds-fill based on MATLAB
fill
- 算法基本思想：首先填充种子点所在扫描线上位于区域内的区段，然后 确定与该区段相邻的上下两条扫描线上位于区域内的区段，并依次将各区段的起始位置保存, 这些区段分别被用区域边界色显示的像素点所包围。随后,逐步取出一开始点并重复上述过程，直到所保存各区段都填充完毕为止。-Algorithm basic idea: first fill the seed point is located in the area of the scanning section, and then determine th
Combined-with-Canny
- 对经典的二值化方法Ostu 算法和Bernsen 算法中存在的缺点进行了分析, 提出一种结合Canny 算子的图像 二值化方法.该方法综合考虑了边缘信息和灰度信息, 通过边缘附近种子点在高阈值二值化图像中的填充和低阈值 图像对它的修补而得到二值化结果图像, 较好地解决了经典二值化方法中存在的抗噪能力差、边缘粗糙、伪影现象 等缺点.实验结果证明, 该方法能够较好地解决低对比度图像和目标像素灰度不均匀图像的二值化问题-The disadvantage of the classical
quyushengzhang
- 实现种子的自主选择和区域生长 以及图片的批量处理 并经过连通域法进行空洞的填充(Realization of independent selection and regional growth of seeds And the batch processing of pictures And the hole filling is carried out through the connected domain method)