您要查找的是不是:
- Finally line clipping algorithms against circles and ellipses are given. 最后,介绍了圆形和椭圆形窗口的直线裁剪算法。
- A FAST LINE CLIPPING ALGORITHM FOR ELLIPSE WINDOWS 一种快速的椭圆形窗口的裁剪算法
- Line Clipping Algorithm Against Arbitrary Polygons 有共线边的多边形窗口的线裁剪算法
- Then, line clipping algorithms and polygon clipping algorithms against polygon windows as well as algorithms for" intersection"," subtraction" and" addition" between regions are described. 然后,介绍了多边形窗口的直线裁剪算法和多边形窗口的多边形裁剪算法以及区域间的“交”、差”和“并”操作。
- LINE CLIPPING ALGORITHM ON CONVEX POLYGON BASED ON LINE'S SLOPE 基于直线斜率的凸多边形线裁剪算法
- Inprovement of Cohen-Suterland Line Clipping Algorithm 改进的Cohen-Sutherland线段裁剪算法
- A 2-D LINE CLIPPING ALGORITHM WITH THE LEAST ARITHMETIC OPERATIONS 具有最少算术运算量的二维线裁剪算法
- line clipping algorithm 线剪取算法
- A novel algorithm is proposed in the paper for line clipping against a general polygon. 作者单位:中国科学院软件研究所计算机科学国家重点实验室;
- In chapter 2, puts forward a very effective clipping algorithm based on line's slope,and compares it with Cyrus-Berk Algorithm . 第二章提出了一种非常有效的基于直线斜率的凸多边形线裁剪算法,并与Cyrus-Berk 算法进行了比较。
- The relationships of polygons arcs nodes are the key method of describing the spatial topological attributes of polygons. This paper introduces a new clipping algorithm which improves Weiler Atherton algorithm for keeping the topological attributes. 多边形 -弧段 -结点之间的联系是描述多边形空间拓扑关系的重要方法 ;为了维护裁剪前后这种拓扑关系的正确与继承性 ;本文在 Weiler- Atherton算法的基础上提出了一种新的算法 .
- Efficient Algorithm for Line Clipping against General Polygon 一般多边形窗口的有效线裁剪算法
- A New Algorithm for Line Clipping against a General Quadrilateral 一种新的任意四边形窗口线裁剪算法
- AN EFFICIENT ALGORITHM FOR THE LINE CLIPPING AGAINST A POLYGON 一个有效的多边形窗口的线裁剪算法
- AN EFFICIENT ALGORITHM FOR THE LINE CLIPPING AGAINST A TRIANGLE 一种三角形窗口线裁剪的新算法
- Four-Region Algorithm: A New Algorithm of Line Clipping 种新的线段裁剪算法-四区域裁剪算法
- AN IMPROVED COHEN-SUTHERLAND ALGORITHM FOR 2D LINE CLIPPING 一个改进的CS两维裁剪算法
- The vertical line meets the horizontal one here. 垂直线与水平线在此相交。
- Parabola Clipping Algorithm Based on N-Steps Rendering Theory 基于多步法绘制理论的抛物线裁剪算法
- One line cuts another at right angles. 一条线与另一条线成直角相交。