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: 57512 |
Author:cc |
Hits:
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: 可以正确执行的Sutherland-Hodgeman多边形裁剪，不过一些小问题需要优化。-can correct implementation of the Sutherland-Hodgeman polygon clipping, But some small problems needed to improve. Platform: |
Size: 1986560 |
Author:王强军 |
Hits:
Description: 梁友栋-Barsky裁剪算法，Cyrus和Beck用参数化方法提出了比Cohen-Sutherland更有效的算法。后来梁友栋和Barsky独立地提出了更快的参数化线段裁剪算法，也称为Liany-Barsky（LB）算法。-You-Xin Liang Dong-Barsky clipping algorithm, Cyrus and Beck used parametric methods than Cohen-Sutherland algorithm more effective. LIANG You-Dong and Barsky was independently put forward a faster Parametric Line Clipping Algorithm, also known as Liany-Barsky (LB) algorithm. Platform: |
Size: 12288 |
Author:杨杨 |
Hits:
Description: 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法的Matlab程序-Divide and conquer strategy based on the Sutherland-Hodgeman polygon clipping algorithm of Matlab procedures Platform: |
Size: 2048 |
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: 1958912 |
Author:秀 |
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:
Description: 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法-Sutherland-Hodgeman polygon clipping algorithm based on the strategy of divide and conquer Platform: |
Size: 3072 |
Author:张 |
Hits:
Description: 实验四
编程实现Cohen-Sutherland线段裁剪算法或者Sutherland-Hodgman多边形裁剪算法
对各种情况进行测试，验证算法实现的完整性
-Experiments four programming Cohen-Sutherland line clipping algorithm or Sutherland-Hodgman polygon clipping algorithms for testing a variety of situations, to verify the integrity algorithm Platform: |
Size: 221184 |
Author:林伟鸿 |
Hits:
Search - sutherland hodgman clipping