Description: Polygon clipping is one of those humble tasks computers do all the time. It s a basic operation in creating graphic output of all kinds. There are several well-known polygon clipping algorithms, each having its strengths and weaknesses. The oldest one (from 1974) is called the Sutherland-Hodgman algorithm. In its basic form, it is relatively simple. It is also very efficient in two important cases, one being when the polygon is completely inside the boundaries, and the other when it s completely outside. Platform: |
Size: 57344 |
Author:cc |
Hits:
Description: 如何在Visual C++中实现Choen-Sutherland线段裁剪算法，实现了基本交互-how to achieve Visual C Choen-Sutherland line cutting algorithm, to achieve the basic interactive Platform: |
Size: 416768 |
Author:liu |
Hits:
Description: 《计算机图形学》
实验一 基本图形的生成
实验目的：
1、编写直线的DDA和Bresenham算法的实现程序，验证算法的正确性。
2、编写圆的Bresenham算法或中点算法的实现程序，验证算法的正确性。
3、用多边形的扫描线填充算法对一多边形进行填充，验证算法的正确性。
4、使用Cohen-Sutherland算法裁减二维线段或使用Sutherland-Hodgman算法对多边形进行裁减，验证算法的正确性。
5、通过算法的编写，切实掌握图形学中直线和圆生成的原理以及图形填充和裁减算法的原理和过程。
实验内容：
1、（必做）编写直线的DDA和Bresenham算法的实现程序。要求：直线的起点与终点坐标通过文本框中输入或添加鼠标程序，实现交互式画直线（用鼠标确定直线的起点和终点）。禁止使用画直线的系统函数。
2、（必做）编写圆的Bresenham算法或中点算法的实现程序。要求：圆的半径与圆心点坐标通过文本框中输入或添加鼠标程序，实现交互式画圆（用鼠标确定圆的圆心和半径）。禁止使用画圆的系统函数。
-"Computer Graphics" experiment, a basic pattern formation of the experiment : 1. DDA prepared a straight line and the Bresenham algorithm procedures, verification algorithm is correct. 2, the preparation of a round of the Bresenham algorithm or midpoint algorithm implementation procedures, verification algorithm is correct. 3, using the polygon scan line algorithm to fill a polygon filling, the verification algorithm correctness. 4. Use Cohen-Sutherland algorithm line or two-dimensional reduction of the use of Sutherland- Hodgman algorithm for polygon reduction, the certification algorithm correctness. 5, algorithm development, really control the graphics linear and circular formation of principle and graphics filling algorithm and the reduction of the principles and processes. Platform: |
Size: 718848 |
Author:fisherman |
Hits:
Description: 可以正确执行的Sutherland-Hodgeman多边形裁剪，不过一些小问题需要优化。-can correct implementation of the Sutherland-Hodgeman polygon clipping, But some small problems needed to improve. Platform: |
Size: 1986560 |
Author:王强军 |
Hits:
Description: 该文件是对计算机图形学中的基本的sutherland算法，使的学习这些抽象知识具体化-The document is a computer graphics Sutherland in the basic algorithm, making the learning of these abstract and concrete knowledge Platform: |
Size: 1024 |
Author:陈手枪 |
Hits:
Description: 1、裁剪算法选用Cohen-Sutherland算法；
2、界面设计友好、直观。
Windows xp，Microsoft Visual C++ 6.0中的MFC AppWizard(exe)下实现的
-1, cutting algorithm selection of Cohen-Sutherland algorithm 2, interface design, friendly, and intuitive. Windows xp, Microsoft Visual C++ 6.0 of the MFC AppWizard (exe) achieved under Platform: |
Size: 81920 |
Author:张巧芳 |
Hits:
Description: 多边形裁剪程序：用到的是比较常见的裁剪算法：Sutherland-Hodgman算法。本程序中的裁剪顺序为左边、下边、右边、上边，那么裁剪是这样进行的：原待裁剪多边形作为输入多边形被裁剪矩形的左边裁剪，然后输出的裁剪结果作为下边裁剪的输入多边形，……，依次类推，直到最后一边矩形上边裁剪结束。-Polygon clipping process: it is more commonly used method of cutting: Sutherland-Hodgman algorithm. This procedure of cutting the order for the left, bottom, right, top, then the cutting is carried out: the original clipping polygon to be clipped polygon as input the left side of the rectangular cutting, then cutting output cut as the bottom of the input polygon, ... ... , and so on, until the last end side of the rectangular cut above. Platform: |
Size: 65536 |
Author:tomomoon |
Hits:
Description: 用C语言实现了Cohen-Sutherland算法，代码可以直接复制到tc里面运行，很好实现了线段裁剪-With the C language to implement Cohen-Sutherland algorithm, the code can be directly copied to the tc run inside, well realized Line Clipping Platform: |
Size: 2048 |
Author:Aboy |
Hits:
Description: 在定义了窗口之后，我们只需将窗口内的图形显示出来，对于窗口之外的图形我们是不关心的。因此，必须将窗口外的图形裁剪下去。在本资料中，实现如下对直线段进行裁剪的算法：Cohen-Sutherland算法、中点分割算法、梁友栋-Barsky算法，并且利用Sutherland-Hodgman算法实现对多边形的裁剪，最后，实现当裁剪域是任意凸多边形时的裁剪算法。-In the definition of the window, we simply window graphics are displayed, in addition to window graphics we are not concerned. Therefore, the need to cut down the graphics outside the window. In this data, to achieve the following sections of the cut line algorithm: Cohen-Sutherland algorithm, the mid-point division algorithm, Liangyou Dong-Barsky algorithm, and using Sutherland-Hodgman polygon clipping algorithm, and finally, to achieve when the cutting domain is arbitrary when the convex polygon clipping algorithm. Platform: |
Size: 1959936 |
Author:秀 |
Hits:
Search - sutherland hodgman