搜索资源列表
CDA1
- Sutherland-Hodgeman多边形裁剪算法：-Sutherland-Hodgeman polygon clipping algorithm :
Sutherland-Hodgeman
- 可以正确执行的Sutherland-Hodgeman多边形裁剪，不过一些小问题需要优化。-can correct implementation of the Sutherland-Hodgeman polygon clipping, But some small problems needed to improve.
裁剪线段,VC
- Cohen-Sutherland裁剪线段程序,VC-Cohen-Sutherland line cutting procedures, VC
裁剪线段算法
- 实现计算机图形学的Cohen Sutherland 算法 实现剪裁 颜色填充等功能 功能强大 代码可重用性强-implement the Cohen Sutherland arithmetic on computer graphics,implement cutting filling collor ,with a powerful reused function
裁剪sutherlan-cohen
- 一个有OPENGL实验的一个裁剪算法，用的是 sutherland-cohen的算法-an experimental OpenGL is a cutting algorithm, using the Sutherland-cohen algorithm
图形的生成
- 实现二维基本图元直线段生成的基本算法（DDA，中点法，Bresenham）实现二维基本图元圆弧/椭圆圆弧生成的基本算法（中点法）实现对线型线宽的属性的控制实现二维多边形扫描转换的扫描线算法实现二维多边形扫描转换的边缘填充算法或栅栏填充算法实现二维连通区域填充的扫描线种子填充算法（四连通或八连通）实现二维直线段裁剪的Cohen-Sutherland裁剪算法和中点分割裁剪算法-basic 2D linear map of the yuan
Cohen-Sutherland
- Cohen-Sutherland算法,有一些简单的交互-Cohen-Sutherland algorithm, there are some simple interactive
Choen-Sutherland
- 如何在Visual C++中实现Choen-Sutherland线段裁剪算法，实现了基本交互-how to achieve Visual C Choen-Sutherland line cutting algorithm, to achieve the basic interactive
Sutherland-Hodgman
- 在Visual C++中实现的Sutherland-Hodgman多边形裁剪算法-achieved by Sutherland-Hodgman polygon clipping algorithm
Polygon
- 为了pudn,我平了两个多边形求交，用Visual C++写的，适合懂MFC的人，感觉写得还不错，-In order to pudn, I tied the two polygons intersect, using Visual C++ Written for MFC understand people who feel very good,
GuangShanHuiTuYanShi
- 这是计算机图形学课程设计程序，实现Breasham、中点、数值微分画线画圆，种子填充、活化边表填充、边填充、Sutherland线段裁减、中点线段裁减、Liang-Basky线段裁减。-This is the computer graphics curriculum design procedures, Breasham, midpoint, numerical differential line drawing Circle, see
cutofbeeline
- 基于VC++6.0实现直线段的Cohen-Sutherland算法裁剪. 操作说明： 打开裁剪.EXE，点击画矩形或画直线，就可以进行画矩形或直线；然后点击裁剪，就可以进行直线段的Cohen-Sutherland裁剪。 -based VC 6.0 line of the Cohen-Sutherland algorithm cutting. Operation Note : Open cut. EXE, it painted
CDA1
- Sutherland-Hodgeman多边形裁剪算法：-Sutherland-Hodgeman polygon clipping algorithm :
Sutherland-Hodgeman
- 可以正确执行的Sutherland-Hodgeman多边形裁剪，不过一些小问题需要优化。-can correct implementation of the Sutherland-Hodgeman polygon clipping, But some small problems needed to improve.
LiangBarsky
- 梁友栋-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 a
DDA_Bresenham_Circle_Ellispe
- DDA画线算法，Bresenhan画线算法，中点圆算法，中点椭圆算法-DDA line drawing algorithm, Bresenhan painted line algorithm, the midpoint circle algorithm, the midpoint ellipse algorithm
PolygonClipping
- 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法的Matlab程序-Divide and conquer strategy based on the Sutherland-Hodgeman polygon clipping algorithm of Matlab procedures
a
- 运用Sutherland-Hodgeman算法的多边形裁剪算法。C语言实现。-The use of the Sutherland-Hodgeman polygon clipping algorithm algorithm. C language.
Cohen-Sutherland
- 用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
Sutherland211143522008
- sutherland_ hodgeman algoritmm. in c++. hope u injoy