搜索资源列表
多边形裁剪算法
- 最快和最好用的多边形裁剪算法-fastest and the best use of polygon clipping algorithm
多边形裁剪程序
- 这是图形学中的多边形裁剪程序，可以在文档中画出一个区域，在用鼠标点击画出多边形的几个顶点，这时多边形就会按照原来画出的区域进行裁剪-this is the polygon graphics cutting procedures, the documents paint a regional, using mouse clicks draw polygons several vertex, then according to the original polygon will be the hea
多边形裁剪
- 用C语言编的多边形裁剪源代码-Code of Clipping Polygons using C language
多边形裁剪
- 计算机图形学—多边形的裁剪算法。
ClipRgn.rar
- 多边形裁剪算法的实现，使用做多变形 绘制测试,Polygon clipping algorithm implementation, the use of testing to do many deformation mapping
liang-barsky
- Weiler-Atherton算法实现多边形裁剪-Weiler-Atherton polygon clipping algorithm
Graphic
- 计算机图形学中用经典算法实现的绘图程序，包括直线生成、圆弧生成、线段裁剪、多边形裁剪等-Computer graphics with the classic algorithm of mapping procedures, including a straight-line generation, arc formation, line cutting, cutting, such as polygon
Clip
- VC6.0实现多边形裁剪。单击左键记录目标多边形，右键记录多边形定点，双击右键闭合多边形。再左键记录裁剪多边形，右键记录多边形定点，双击右键闭合多边形。实现裁剪。-VC6.0 achieve polygon clipping. Click the left records the target polygon, right-record fixed-point polygon, double-click the right-closed polygon. Polygon Clipping rec
vccut
- 多边形裁剪算 法多边形裁剪算法-Polygon Clipping Algorithm Polygon Clipping Algorithm
polygon_cut
- 多边形裁剪算法研究与实现 多边形裁剪算法研究与实现-the algorithm of cuting from polygons.
a
- 运用Sutherland-Hodgeman算法的多边形裁剪算法。C语言实现。-The use of the Sutherland-Hodgeman polygon clipping algorithm algorithm. C language.
duobianxingcaijian
- 学习图形学时编制的多边形裁剪算法实例，希望对学习图形血的朋友们有所助益-Graphics prepared to learn when the polygon clipping algorithm for instance, want to learn graphic bloody helpful friends
PolygonCut
- 用weiler-atherton算法完成图形的多边形裁剪。-The Polygon is clipped using weiler-atherton algorithm.
duobianxingjiancai
- 计算机图形学-基于weiler-atherton算法的多边形裁剪程序实现-Computer Graphics- weiler-atherton algorithm based on polygon cutting process to achieve
GPC
- 该源码可用于GIS地图开发中的多边形裁剪功能——GPC通用多边形裁剪算法-For the general polygon clipping
polygonclip_demo
- 使用VC++6.0进行多边形裁剪的程序，计算机图形学程序-Use VC++6.0 program for polygon clipping, computer graphics programs
Sutherland
- 图形学用Sutherland-Hodgman算法进行多边形裁剪-Sutherland- with Hodgman algorithm polygon cropping
clipper
- 从代码仓库中下载的最新的用于二维任意复杂多边形裁剪代码，该代码使用Bala Vatti的多边形裁剪算法，并做了多种扩展和改进，提供多个版本（Delphi Pascal C++ C# ）的源码和测试程序和简明的帮组文档，方便用户使用。 sandbox tags trunk-The Clipper Library is based on but significantly extends Bala Vatti s polygon clipping algorithm as describ
vc++多边形裁剪算法
- vc++版本多边形裁剪算法，十分有用，适合初学者
Gpforth
- 实现多边形裁剪,被裁剪部分用绿色表示，裁剪区域内的部分用红色表示(Polygon clipping is implemented, and the cropped part is represented by green. The part in the clipping area is represented by red)