Description: 图形学的代码，使用系统提供的绘点函数，加上自己的算法。可以画出直线。包括DDA算法和breshenham算法，中心点画圆和8分画圆，提供种子填充算法，多边形画法。-graphics code, the use of the system provides painted point function, together with its own algorithm. Sense straight. DDA include algorithms and breshenham algorithm, the crux Circle Circle and 8 pm, providing seed filling algorithm, polygon painting. Platform: |
Size: 58706 |
Author:黄显龙 |
Hits:
Description: 1． 做一个集成的图形界面的程序，可调用每一次作业子程序。
2． 调用画点的函数，用DDA、中点算法画直线和中点算法及正负法画圆和抛物线。
3． 交互式的二维直线求交：如果存在交点，用实心圆显示交点，并用文字显示其坐标。
4． 用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括自行车行走和绕固定点旋转的自旋转物体动画。）
5． 线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。
6． 两种扫描多边形扫描转换算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法任选一种）；
7． 4连通区域的递归种子填充算法，和扫描线种子填充算法，要求种子点(x,y)可交互输入）。
8． 简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。
9． 交互式Bezier曲线的输入绘制程序实现
-1. So an integrated graphical interface procedures, which call for each operation subroutine. 2. Calling the painting point function, with DDA, the midpoint algorithm painting line and the midpoint algorithm and France Circle and the positive and negative parabola. 3. Interactive 2D linear intersection : If there intersection with a solid circle indicates Nodal and writing to demonstrate its coordinates. 4. Using 2D animation graphics transform algorithms to achieve the specified physical translation, rotation and scaling. (Including walking and cycling around the fixed point of rotating objects from the rotating animation.) 5. Line cutting and polygon clipping algorithm to achieve the animation demo. (Two segments cutting algorithm and H-S-by-side polygon clipping algorithm) polygon clipp Platform: |
Size: 108711 |
Author:张斌 |
Hits:
Description: 实验内容：
1 实现扫描转换多边形的算法填充多边形。
实现内容：
1， 可以画任意多边形。
2， 三角形也是通过扫描转换多边形的算法实现。
具体实现：
画多边形用moveto(),lineto(),两个函数实现画没一条边。
构造ET表，AEL表，通过这两个表填充多边形。
画图步骤：
1. 取顶点：用n记录顶点个数，按下鼠标开始取点，第二次按下取得第二个顶点，第i次按下取得第i 个顶点。取得的顶点放到Verex[]中。
2. 画多边形：按下菜单按钮----多边形。画多边形时可通过颜色菜单选择填充颜色。
3. 填充多边形：按下菜单按钮----填充。填充时可通过颜色菜单选择填充颜色。
4. 重新画一个多边形时需要先点菜单---new，然后再重复1，2，3步。
-experiment : to achieve a polygon scan conversion algorithm filled polygons. Implementation : a can draw arbitrary polygon. 2, as well as through the triangular polygon scan conversion algorithm. Realization : painting polygon with moveto (), LineTo (), two paintings did not function to achieve an edge. Construction ET table, Table AEL, through these two tables filled polygons. Drawing steps : 1. Vertex admitted : n vertices record number, press the mouse started to admit, the second press made the second vertices, i pressed the first time i made its vertex. The vertex put Verex []. 2. Painting polygon : press the menu button-polygon. When painting polygon can be filled with color menu to choose colors. 3. Polygon Filling : press the menu button-filled. When filled with color by color fill Platform: |
Size: 51309 |
Author:god |
Hits:
Description: 根据多边形区域的填充原理可以推广到圆域的填充，由于圆的特殊属性，即可根据任何欲填充的像素点与圆心的距离是否大于或小于半径来判断是否在圆内或圆外，具体实现程序如下；
利用中点画圆算法实现边界程序：
void CArea_FillData::MidpointCircle(int xc, int yc, int r, int color)
{//画八分之一的圆
int x,y,d
x=0 y=r d=1-r
WholeCircle(xc,yc,x,y,color)
while(x<y)
-According to the regional polygon filling principle can be extended to the domain filled round, a round of special attributes, can be filled under any wishes to the central pixel and the distance is greater than or less than the radius to determine whether the circle or round, realize the procedure is as follows; Midpoint Circle Algorithm border procedures : void CArea_FillData : : MidpointCircle (int xc. yc int, int r, int color) (/ / painting of the eighth round int x, y, d x = 0 y = r d = 1-r WholeCircle (xc, yc, x, y, color) while (x Platform: |
Size: 81758 |
Author:周林 |
Hits:
Description: 该程序实现了图形学中的一些算法，如画线、画圆，填充、直线多边形、扫描转换，扫描线消隐算法以及一个简单的Gouraud光照模型。-the realization of a number of graphics algorithms, painting lines, the Circle, filling, linear polygon scan conversion, Lines scanning algorithm and a simple scan illumination model. Platform: |
Size: 725652 |
Author:青海长云 |
Hits:
Description: 直线段的裁剪和绘制，1、自由曲线包括：二次、三次Bezier曲线，二次、三次均匀B样条曲线；
2、Bezier曲线的实现算法要求选用细分算法；
3、均匀B样条曲线过控制多边形的首末顶点；
4、利用B样条曲线的局部控制性来动态修改曲线形状；
5、界面设计友好、几何直观。
裁剪算法选用Cohen-Sutherland算法；
-straight of the cutting and painting, a free curve include : second, third Bezier curves, second, Third uniform B-spline curves; 2, Bezier curve algorithm selection requirements subdivision algorithm; 3. Uniform B-spline curve control over the end of the first polygon vertices; 4. B-spline curves of local control to dynamically change curve shape; 5, friendly interface design, visual geometry. Cutting Algorithm Selection Cohen-Sutherland algorithm; Platform: |
Size: 331797 |
Author:rtshen |
Hits:
Description: 关于vc里画图形的程序。包括画多边形，错切，裁剪，旋转，变换，填充等等的操作。还包括中点画线算法等。-on vc Lane painting graphics procedures. Polygon, including painting, wrong cutting, cutting, rotating, transform, filled out the operation. Also included were dotted line algorithm. Platform: |
Size: 75130 |
Author:孔的 |
Hits:
Description: 关于vc里画图形的程序。包括画多边形，错切，裁剪，旋转，变换，填充等等的操作。还包括中点画线算法等。-on vc Lane painting graphics procedures. Polygon, including painting, wrong cutting, cutting, rotating, transform, filled out the operation. Also included were dotted line algorithm. Platform: |
Size: 74752 |
Author:孔的 |
Hits:
Description: 图形学的代码，使用系统提供的绘点函数，加上自己的算法。可以画出直线。包括DDA算法和breshenham算法，中心点画圆和8分画圆，提供种子填充算法，多边形画法。-graphics code, the use of the system provides painted point function, together with its own algorithm. Sense straight. DDA include algorithms and breshenham algorithm, the crux Circle Circle and 8 pm, providing seed filling algorithm, polygon painting. Platform: |
Size: 58368 |
Author:黄显龙 |
Hits:
Description: 1． 做一个集成的图形界面的程序，可调用每一次作业子程序。
2． 调用画点的函数，用DDA、中点算法画直线和中点算法及正负法画圆和抛物线。
3． 交互式的二维直线求交：如果存在交点，用实心圆显示交点，并用文字显示其坐标。
4． 用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括自行车行走和绕固定点旋转的自旋转物体动画。）
5． 线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。
6． 两种扫描多边形扫描转换算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法任选一种）；
7． 4连通区域的递归种子填充算法，和扫描线种子填充算法，要求种子点(x,y)可交互输入）。
8． 简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。
9． 交互式Bezier曲线的输入绘制程序实现
-1. So an integrated graphical interface procedures, which call for each operation subroutine. 2. Calling the painting point function, with DDA, the midpoint algorithm painting line and the midpoint algorithm and France Circle and the positive and negative parabola. 3. Interactive 2D linear intersection : If there intersection with a solid circle indicates Nodal and writing to demonstrate its coordinates. 4. Using 2D animation graphics transform algorithms to achieve the specified physical translation, rotation and scaling. (Including walking and cycling around the fixed point of rotating objects from the rotating animation.) 5. Line cutting and polygon clipping algorithm to achieve the animation demo. (Two segments cutting algorithm and H-S-by-side polygon clipping algorithm) polygon clipp Platform: |
Size: 2161664 |
Author:张斌 |
Hits:
Description: 实验内容：
1 实现扫描转换多边形的算法填充多边形。
实现内容：
1， 可以画任意多边形。
2， 三角形也是通过扫描转换多边形的算法实现。
具体实现：
画多边形用moveto(),lineto(),两个函数实现画没一条边。
构造ET表，AEL表，通过这两个表填充多边形。
画图步骤：
1. 取顶点：用n记录顶点个数，按下鼠标开始取点，第二次按下取得第二个顶点，第i次按下取得第i 个顶点。取得的顶点放到Verex[]中。
2. 画多边形：按下菜单按钮----多边形。画多边形时可通过颜色菜单选择填充颜色。
3. 填充多边形：按下菜单按钮----填充。填充时可通过颜色菜单选择填充颜色。
4. 重新画一个多边形时需要先点菜单---new，然后再重复1，2，3步。
-experiment : to achieve a polygon scan conversion algorithm filled polygons. Implementation : a can draw arbitrary polygon. 2, as well as through the triangular polygon scan conversion algorithm. Realization : painting polygon with moveto (), LineTo (), two paintings did not function to achieve an edge. Construction ET table, Table AEL, through these two tables filled polygons. Drawing steps : 1. Vertex admitted : n vertices record number, press the mouse started to admit, the second press made the second vertices, i pressed the first time i made its vertex. The vertex put Verex []. 2. Painting polygon : press the menu button-polygon. When painting polygon can be filled with color menu to choose colors. 3. Polygon Filling : press the menu button-filled. When filled with color by color fill Platform: |
Size: 51200 |
Author:god |
Hits:
Description: 根据多边形区域的填充原理可以推广到圆域的填充，由于圆的特殊属性，即可根据任何欲填充的像素点与圆心的距离是否大于或小于半径来判断是否在圆内或圆外，具体实现程序如下；
利用中点画圆算法实现边界程序：
void CArea_FillData::MidpointCircle(int xc, int yc, int r, int color)
{//画八分之一的圆
int x,y,d
x=0 y=r d=1-r
WholeCircle(xc,yc,x,y,color)
while(x<y)
-According to the regional polygon filling principle can be extended to the domain filled round, a round of special attributes, can be filled under any wishes to the central pixel and the distance is greater than or less than the radius to determine whether the circle or round, realize the procedure is as follows; Midpoint Circle Algorithm border procedures : void CArea_FillData : : MidpointCircle (int xc. yc int, int r, int color) (//painting of the eighth round int x, y, d x = 0 y = r d = 1-r WholeCircle (xc, yc, x, y, color) while (x Platform: |
Size: 91136 |
Author:周林 |
Hits:
Description: 该程序实现了图形学中的一些算法，如画线、画圆，填充、直线多边形、扫描转换，扫描线消隐算法以及一个简单的Gouraud光照模型。-the realization of a number of graphics algorithms, painting lines, the Circle, filling, linear polygon scan conversion, Lines scanning algorithm and a simple scan illumination model. Platform: |
Size: 724992 |
Author:青海长云 |
Hits:
Description: 直线段的裁剪和绘制，1、自由曲线包括：二次、三次Bezier曲线，二次、三次均匀B样条曲线；
2、Bezier曲线的实现算法要求选用细分算法；
3、均匀B样条曲线过控制多边形的首末顶点；
4、利用B样条曲线的局部控制性来动态修改曲线形状；
5、界面设计友好、几何直观。
裁剪算法选用Cohen-Sutherland算法；
-straight of the cutting and painting, a free curve include : second, third Bezier curves, second, Third uniform B-spline curves; 2, Bezier curve algorithm selection requirements subdivision algorithm; 3. Uniform B-spline curve control over the end of the first polygon vertices; 4. B-spline curves of local control to dynamically change curve shape; 5, friendly interface design, visual geometry. Cutting Algorithm Selection Cohen-Sutherland algorithm; Platform: |
Size: 331776 |
Author:rtshen |
Hits:
Description: 计算机图形学大作业，一、 调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。二、多边形扫描转换算法和区域填充算法实现。三、线段裁剪和多边形裁剪算法的动画演示实现。四、交互式的二维直线求交：如果存在交点，用实心圆显示交点，并用文字显示其坐标。五、自行车行走和绕固定点旋转的自旋转物体动画。六、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。七、交互式Bezier曲线的输入绘制程序实现
-Computer Graphics big operation, a point of calling a function of painting with DDA, the mid-point algorithm for drawing a straight line and the mid-point algorithm drawcircle and elliptical. Second, polygon scan conversion algorithm and region filling algorithm. Third, cutting line and polygon clipping algorithm to achieve the animated demo. Fourth, interactive two-dimensional linear intersection: If the existence of intersection, with a solid round show Nodal, and text display its coordinates. Fifth, walking and bike rotating around a fixed point of self-rotating object animation. Sixth, a simple three-dimensional graphics system: convex polyhedron modeling, perspective projection, hidden surface elimination and basic graphics transform (translation, rotation, scaling). Seven, interactive input Bezier curve drawing program Platform: |
Size: 3697664 |
Author:ling |
Hits:
Description: 一个集成的图形界面的程序，可调用每一次作业子程序。一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。）五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。六、交互式Bezier曲线的输入绘制程序实现-An integrated graphical interface program, can call the subroutine each operation. First, call the painting point function, the DDA, the mid-point operator
France and the midpoint line drawing algorithm draw a circle and ellipse. 2, polygon scan conversion algorithm and region filling algorithm (scan line algorithm
The will to do more than seek operation based on the edge of fill, and sign algorithms for the optional side seed-based region filling using 4-connected region
Recursive seed fill algorithm, or scan line seed fill algorithm to require seed point (x, y) can be interactive input). 3, line cutting and
Polygon clipping algorithm to achieve animation. (Two segments by cutting edge algorithms and HS polygon clipping algorithm) polygon clipping
Algorithm animation requirements first draw a closed polygon, and then draw the crop rectangle window, then select the crop button (or
Command), press the "cut on top" button (or the implementation of the "cut on top" command), Platform: |
Size: 15465472 |
Author:Peng |
Hits:
Description: 一个集成的图形界面的程序，可调用每一次作业子程序。
一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。
二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。
三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。
四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。）
五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。
六、交互式Bezier曲线的输入绘制程序实现
-An integrated graphical interface of the program, each operation subroutine callable.
One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval.
Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively).
Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of Platform: |
Size: 87040 |
Author:xuzhimin |
Hits:
Description: 种子算法，种子填充算法又称为边界填充算法。其基本思想是：从多边形区域的一个内点开始，由内向外用给定的颜色画点直到边界为止。如果边界是以一种颜色指定的，则种子填充算法可逐个像素地处理直到遇到边界颜色为止。
种子填充算法常用四连通域和八连通域技术进行填充操作。-Seed algorithm, seed filling algorithm, also known as the boundary filling algorithm. The basic idea is: starting a point within the polygon area within the external point of a given color painting until the border. If the border is a color specified, the seed filling algorithm processing pixel by pixel until it reaches the border color so far. Seed filling algorithm for the Four and eight-connected components connected domain technique the filling operation. Platform: |
Size: 11171840 |
Author:FanYang |
Hits:
Search - polygon painting algorithm