Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - sutherland hodgman polygon clipping
Search - sutherland hodgman polygon clipping - List
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.
Date : 2008-10-13 Size : 56.16kb User : cc

在Visual C++中实现的Sutherland-Hodgman多边形裁剪算法-achieved by Sutherland-Hodgman polygon clipping algorithm
Date : 2008-10-13 Size : 47.13kb User : liu

实现多边形裁剪的算法-achieve polygon clipping algorithm
Date : 2025-07-08 Size : 3kb User : 刘景

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.
Date : 2025-07-08 Size : 56kb User : cc

多边形的剪裁,用VB开发,裁剪掉划定范围外的部分-polygon clipping, using VB, cutting out outside the designated part
Date : 2025-07-08 Size : 3kb User : 张敬

在Visual C++中实现的Sutherland-Hodgman多边形裁剪算法-achieved by Sutherland-Hodgman polygon clipping algorithm
Date : 2025-07-08 Size : 402kb User : liu

DL : 0
Sutherland-Hodgeman多边形裁剪算法:-Sutherland-Hodgeman polygon clipping algorithm :
Date : 2025-07-08 Size : 1.89mb User : 王强军

可以正确执行的Sutherland-Hodgeman多边形裁剪,不过一些小问题需要优化。-can correct implementation of the Sutherland-Hodgeman polygon clipping, But some small problems needed to improve.
Date : 2025-07-08 Size : 1.89mb User : 王强军

基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法的Matlab程序-Divide and conquer strategy based on the Sutherland-Hodgeman polygon clipping algorithm of Matlab procedures
Date : 2025-07-08 Size : 2kb User : 章礼平

多边形裁剪程序:用到的是比较常见的裁剪算法: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.
Date : 2025-07-08 Size : 64kb User : tomomoon

在定义了窗口之后,我们只需将窗口内的图形显示出来,对于窗口之外的图形我们是不关心的。因此,必须将窗口外的图形裁剪下去。在本资料中,实现如下对直线段进行裁剪的算法: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.
Date : 2025-07-08 Size : 1.87mb User :

在定义了窗口之后,我们只需将窗口内的图形显示出来,对于窗口之外的图形我们是不关心的。因此,必须将窗口外的图形裁剪下去。在本资料中,实现如下对直线段进行裁剪的算法: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.
Date : 2025-07-08 Size : 1.87mb User :

基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法-Sutherland-Hodgeman polygon clipping algorithm based on the strategy of divide and conquer
Date : 2025-07-08 Size : 3kb User :

实验四 编程实现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
Date : 2025-07-08 Size : 216kb User : 林伟鸿

实验四 编程实现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
Date : 2025-07-08 Size : 218kb User : 林伟鸿

DL : 0
掌握sutherland-hodgman多边形裁剪算法- master Sutherland-Hodgman polygon clipping algorithm
Date : 2025-07-08 Size : 4.52mb User : yangqi

sutherland-Hodgman polygon clipping
Date : 2025-07-08 Size : 1kb User : koncard1

Sutherland-Hodfman多边形裁剪(Sutherland-Hodfman polygon clipping algorithm)
Date : 2025-07-08 Size : 2kb User : ProHanziiee
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.