Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clipping areas. ~3kb footprint, no dependencies
-
Updated
Apr 15, 2023 - JavaScript
Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clipping areas. ~3kb footprint, no dependencies
Clipping of simple polygons with degenerate vertices in Javascript
Boolean operations on polygons (union, intersection, difference, xor)
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Add a description, image, and links to the polygon-union topic page so that developers can more easily learn about it.
To associate your repository with the polygon-union topic, visit your repo's landing page and select "manage topics."