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: 区域填充和影线填充原理,算法和实现 图形几何变换,投影变换和视向变换的方法和实现 直线段,多边形裁剪算法和实现 曲线生成原理,算法和实现 常用的消隐算法 -area filling and filling hatched theory, algorithms and graphic geometric transformation, and visual projection transformation to transform the methods and linear, polygon clipping algorithm and the realization Curve theory, algorithms and implementation of the commonly used algorithms blanking Platform: |
Size: 3072 |
Author:王宇 |
Hits:
Description: 多边形裁剪是逐次多边裁剪法，它的基本思想是以窗口的四条边界线单一逐次对多边形裁剪-polygon clipping is Successive multilateral cutting, its basic idea is a window four successive boundaries of a single polygon clipping Platform: |
Size: 1024 |
Author:00 |
Hits:
Description: 一种多边形裁剪算法,可用于任意的多边形进行裁减。使用OpenGL编写。-a polygon clipping algorithm can be used for arbitrary polygon reduction. Use OpenGL prepared. Platform: |
Size: 72704 |
Author:丁钱飞 |
Hits:
Description: An article on 2-D Polygon Clipping with the source code-An article on 2-D Polygon with the Clipping source code Platform: |
Size: 57344 |
Author: |
Hits:
Description: 1. 简单图元的生成（如直线、圆、长方形等）
2. 用DDA算法或中点（Besenham）算法实现直线段、椭圆或圆的绘制
3. 用扫描线填充算法进行区域填充,用Sutherland 裁剪算法裁减多边形
4. BEZIER曲线或B样条曲线的绘制
5. 个性化图形软件包的开发
6. 所有文件包括源码和截图-1. Easy metafile generation (such as linear, round, rectangular, etc) 2. Using DDA algorithm or the mid-point (Besenham) algorithm achieve a straight line segment, draw an oval or round 3. Scanline fill algorithm used to populate the region, with Sutherland reduction of polygon clipping algorithm 4. BEZIER curve or B-spline Curve 5. personalized graphics package development 6. all documents, including source code and screenshot Platform: |
Size: 1444864 |
Author:lixuan |
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:
Search - clipping polygon