The Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons.
26 Feb 2020:
Since it's been some time since the last update, some may be wondering if I no longer plan further updates. I do have an update in the works (see the sandbox folder under 'Code' above) but I also have not life threatening health problems that slow me down. Anyhow I do hope to get Clipper2 released sometime this year.
Features
- Line and polygon clipping - intersection, union, difference & xor
- Line and polygon offsetting with 3 types of joining - miter, square and round
- Polygons can be of any shape, including self-intersecting polygons
- Minkowski Addition and Minkowski Difference functions included
- The library is written in Delphi, C++, C# and Python
- Comprehensive documentation
- Demos use AGG, Cairo, OpenGL, GDI+ & Graphics32 graphics libraries
- The library is significantly faster than commercial alternatives
- Third-party modules for Perl, Ruby and Python languages
Project Samples
Categories
AlgorithmsFollow Clipper
Other Useful Business Software
Rate This Project
Login To Rate This ProjectUser Reviews
-
Great!
-
Awesome it does work with intersected polygons.
-
I've been using the library for years now and been happy with it ever. I've not filled in the support rating, haven't needed support. I'm happy with the (beta) 2.0 variant and will try find out whether it is thread-safe, perhaps helping a bit in that area if needed. EDIT: In the mean time I found out I can use it in a multitrheaded way, which really helps. What I'm not yet able to do, is to predict (approx) how long clipping will take as a function of the number of (sub)polygons and vertices. I have some really large use-cases where the runtimes surprise me, in both directions.
-
The greatest lib for polygon operations
-
Great library