搜索资源列表
bresenham
- 计算机图形学实验: 实现Bresenham算法绘制线段,并利用“橡皮筋”功能绘制折线。 可将绘制的折线连接成多边形,并选择种子填充法或扫描线填充法进行填充。-Computer Graphics Lab: Bresenham algorithm for drawing line segments to achieve, and to use " rubber band" line drawing functions. Line connection can be draw
ScanLine_Z-buffer-1
- 扫描线Z-buffer算法作业,实现了简单的扫描线算法-Scan line Z-buffer algorithm operation, to achieve a simple scan line algorithm
RadialPointInPolygon
- 扫描线填充多边形算法,C语言描述,判断点是否在多边形内、-RadialPointInPolygon
Graphics
- 一个集成的图形界面的程序,可调用每一次作业子程序。一、调用画点的函数,用DDA、中点算法画直线和中点算法画圆和椭圆。二、多边形扫描转换算法和区域填充算法实现(扫描线算法为必做,基于求余运算的边缘填充和边标志算法为任选;基于种子的区域填充采用4连通区域的递归种子填充算法,或扫描线种子填充算法,要求种子点(x,y)可交互输入)。三、线段裁剪和多边形裁剪算法的动画演示实现。(两种线段裁剪算法和H-S多边形逐边裁剪算法)多边形裁剪算法的动画演示要求先画出一个封闭的多边形,再画矩形的裁剪窗口,然后选择裁剪
20105169404612157
- 使用VC平台,C++开发的扫描线种子填充算法,运行后点击视窗即可自动绘制边缘区域,并自动填充。-Platform using VC, C++ Development scan line seed fill algorithm, then click the window you can run the automatic drawing of the edge area, and automatically fill.
sy5
- 用C语言进行图形填充,采用扫描线算法完成-Filled with C language for graphics, the use of scan line algorithm to complete
Scanlinefill
- 用C++和OpenGL结合,实现图形学中扫描线填充算法的多边形的填充-Filled with the scan line polygon fill algorithm
HW02_02
- 本程序实现扫描线填充算法。使用设备坐标系。 首先输入多边形顶点个数,比如:10; 第一个顶点坐标:100 400; 第二个顶点坐标:170 450; 第三个顶点坐标:250 450; 第四个顶点坐标:300 350; 第五个顶点坐标:350 350; 第六个顶点坐标:400 300; 第七个顶点坐标:300 200; 第八个顶点坐标:200 200; 第九个顶点坐标:150 270; 第十个顶点坐标:100 270; 例二处理自交多变形
ScanFill-Sutherland
- 该程序包含两部分,一部分使用扫描线区域填充算法完成多边形的扫描显示,另一部分使用Cohen-Sutherland算法实现直线裁剪-The program consists of two parts, using the scan line polygon area fill algorithm scans showed complete, the other using the Cohen-Sutherland line clipping algorithm
saomiaoxian
- 计算机图形学,简单的扫描线程序,用VC++实现。-Computer graphics, a simple scan line process, using VC++ implementation.
scanline
- 画出简单的图形,并且用扫描线的方法将其填充-Using scanline method of filling graphics
PolygonRegionFilling
- 多边形填充,采用种子算法、扫描线算法实现,并且附有详细分析文档。-Polygon region filling project for Computer Graphy course, using seeding and scanning method and with rich analysing document
opengl
- 使用OpenGL实现DDA、中点画线法、Bresenham算法绘制;中点画圆法、Bresenham画圆算法;多边形扫描线转换算法;多边形裁剪--逐边裁剪法等计算机图形学基本算法。-Use OpenGL, DDA, the dotted line method, Bresenham algorithm to draw midpoint drawcircle, Bresenham circle algorithm polygon scan line conversion algorithm p
AddFog1
- 对图像进行加雾处理,用的是按行扫描线的方法,使原图片加雾-Plus fog the image processing, using a method of scanning line by line, so the original image plus fog
aimagesegmentationmethod
- 基于扫描线的带钢低对比度缺陷图像分割技术:本文提出了基于扫描线阀值分割的方法,解决了在采用梯度算子对图像进行预处理存在的漏检问题。-Strip based on scan line defects in low-contrast image segmentation: In this paper, the threshold based on scan line segmentation method to solve the gradient operator in the use of th
Scan-line-filling
- 可以实现扫描线填充的算法,语言为C++,在VS2008中实现的程序-Can scan line fill algorithm
Single
- 这是单文档的图形学程序,可实现画线,直线、多边形的裁切以及扫描线填充等功能-This is a single document, graphics program, allows drawing lines, line, polygon scan line of cut and fill and other functions
scanlineFlling
- 用扫描线填充算法实现区域填充,是计算机图形学中的经典例子.-using scanline filling algorithm to fill certain domain,it is the classic example of computer graphics
SketchPad
- 图形学Weiler-Atherton裁剪算法、Brensenham画线、画圆算法和扫描线填充算法。做成一个类似于Windows画笔的东西。-Graphics Weiler-Atherton clipping algorithm, Brensenham drawing a line, circle algorithm and scan line fill algorithm. A brush made of something similar to Windows. May be required
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