Location:
Search - polygon union
Search list
Description: 求两个多边形交集的程序，使用计算几何实现的，值得学习-intersection of polygons for the two procedures, the use of computational geometry to achieve, and worth learning
Platform: |
Size: 131540 |
Author: cwj |
Hits:
Description: 求两个多边形交集的程序，使用计算几何实现的，值得学习-intersection of polygons for the two procedures, the use of computational geometry to achieve, and worth learning
Platform: |
Size: 131072 |
Author: cwj |
Hits:
Description: 属于AE源码。在程序中对相交线的打断，对线的修剪以及合并（union）两个polygon要素。对选区区域测量其面积和周长。-AE source is. In the proceedings of the interrupted line of intersection of line cutting and union (union) of two polygon elements. Region of the constituency of its size and girth measurements.
Platform: |
Size: 16384 |
Author: zbt |
Hits:
Description: 从代码仓库中下载的最新的用于二维任意复杂多边形裁剪代码，该代码使用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 described in "A generic solution to polygon clipping", Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.
The library can perform each of the four boolean clipping operations- intersection, union, difference and exclusive-or (xor). It can accept any number of, and any type of polygon as input (including self-intersecting polygons). Duplicate vertices and coincident edges are also accommodated.
Polygon holes are handled implicitly, based on polygon orientation. Polygon holes are implied by having their orientations opposite the orientation of their container polygons.
The Clipper package contains the core library, a help file and a number of compiled examples. The library s code was initially written in Delphi Pascal (and compiles in version 7 and up) but now contains C++ and C# translations too. The code in each language is a little over 100K, or about 3500 li
Platform: |
Size: 4333568 |
Author: highrisk |
Hits:
Description: 封闭多边形的交、并，因工作需要从网上找到的论文，还比较实用。-intersection of polygon,union of polygon
Platform: |
Size: 361472 |
Author: 南枫 |
Hits:
Description: 两个简单多边形求并与交，将两个多边形的顶点$交点分别按某种时针方向排序并依次连接#本文中以逆时针为计算方向#然后搜索围成的闭合区域，即可形成交集或者并集。-Two polygon union&Intersection
Platform: |
Size: 126976 |
Author: 田坤瑞 |
Hits:
Description: 计算任意多边形的相交面积和相并面积，用于衡量多边形的重合度(calculate the intersection area and union area of arbitrary polygon)
Platform: |
Size: 1024 |
Author: 530001541@163.com
|
Hits: