Clipping Simple Polygons with Degenerate Intersections

• Here you can download the C++ implementation of our extension of the Greiner-Hormann clipping algorithm, which computes the intersection (or union) of two non-self-intersecting complex polygons, with possibly multiple and nested components, even in case of degenerate intersections (vertex on edge, overlapping edges, etc.).
• Download the C++ implementation.
• Download example polygons.