Overview

The Clipper Library performs clipping, and offsetting of both lines and polygons.

Note: This library has been superseded by my new Clipper2 polygon clipping library.

A number of features set Clipper apart from other clipping libraries:

it accepts all types of polygons including self-intersecting ones
it supports multiple polygon filling rules (EvenOdd, NonZero, Positive, Negative)
it's very fast relative to other libraries
it's numerically robust
it also performs line and polygon offsetting
it's free to use in both freeware and commercial applications

Clipper1: 6.4.2 (obsolete - see note above re Clipper2)

Author & copyright:
Angus Johnson. Copyright © 2010-2022
License, terms and conditions: Boost Software License

Terminology:

Clipping: In 2-dimensional geometry, clipping commonly refers to the process of removing those geometric objects, or parts of objects, that appear outside a rectangular 'clipping' window. Since geometric objects are typically represented by series of paths (lines and polygons), clipping is achieved by intersecting these paths with a clipping rectangle. In a more general sense, the clipping window need not be rectangular but can be any type of polygon, even multiple polygons. Also, while clipping typically refers to an intersection operation, in this documentation it will refer to any one of the four boolean operations (intersection, union, difference and exclusive-or).
Path: is an ordered sequence of vertices defining a single geometric contour that may be either a line (an open path) or a polygon (a closed path).
Line: or polyline is an open path containing 2 or more vertices.
Polygon: commonly refers to a two-dimensional region bounded by an outer non-intersecting closed contour. That region may also contain a number of 'holes'. In this documentation however, polygon will simply refer to a closed path.
Contour: synonymous with path.
Hole: is a closed region within a polygon that's not part of the polygon. A 'hole polygon' is a closed path that forms the outer boundaries of a hole.
Polygon Filling Rule: Given a series of closed paths, the filling rule defines which regions are inside (ie 'brush filled' in a graphical display) and which regions are outside (ie 'holes').

Distribution package contents:

The ZIP package contains the Clipper library's source code, a Windows CHM help file, HTML help, and a number of compiled demo applications (with full source code). The library was initially written in Delphi Pascal and compiles in all versions of Delphi including and above version 7. However, the library now contains C++, C# ports (translations) too. The source code in each language is about 5000 lines. The Delphi code contains reasonably extensive comments, but comments are fewer in the other languages.

Download Link:

GitHub

References:

The 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.

A section in "Computer graphics and geometric modeling: implementation and algorithms" by By Max K. Agoston (Springer, 2005) discussing Vatti Polygon Clipping was also helpful in creating the initial Clipper implementation.

The paper titled "Polygon Offsetting by Computing Winding Numbers" by Chen & McMains (Paper no. DETC2005-85513, ASME 2005. Pages 565-575) contains helpful discussion on the complexities of polygon offsetting together with some solutions.

Overview

See Also