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: 从代码仓库中下载的最新的用于二维任意复杂多边形裁剪代码，该代码使用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:
Search - polygon union. code