w8r / GreinerHormann
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
☆239Updated last year
Related projects ⓘ
Alternatives and complementary repositories for GreinerHormann
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆701Updated 3 months ago
- Small lib for polygon offsetting(margin/padding)☆251Updated last year
- A very fast JavaScript polyline and polygon clipping library☆173Updated 2 years ago
- Boolean operations on polygons (union, intersection, difference, xor)☆611Updated 7 months ago
- 2D constrained Delaunay triangulation☆239Updated 5 years ago
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆287Updated 8 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆551Updated 6 months ago
- k-nearest neighbors search (KNN) for RBush☆212Updated last month
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆82Updated 5 years ago
- perform boolean operations on arbitrary polygons in 2d☆89Updated 9 years ago
- Clipper Abstraction (simplified API)☆113Updated last year
- A 2D constrained Delaunay triangulation library☆321Updated 6 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆153Updated 3 years ago
- Original : http://sourceforge.net/projects/jsclipper☆87Updated 11 years ago
- gets miter normals for a 2D polyline☆132Updated 11 months ago
- Boolean operations and offsetting library in Javascript☆174Updated last year
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆67Updated 3 months ago
- JavaScript library that builds concave hull by set of points. Note: this library is not actively maintained since 2015, only critical iss…☆587Updated this week
- A library of intersection algorithms covering all SVG shape types☆343Updated 10 months ago
- A JavaScript tool for working with polygons.☆53Updated 7 years ago
- triangulates a 2D polyline into a stroke☆167Updated 5 years ago
- Smooth curves through points. No control points needed. Native implementation.☆121Updated 3 years ago
- manipulate polygons in 2d space☆135Updated 8 years ago
- A fast static index for 2D points☆635Updated last month
- Decompose 2D polygons into convex pieces.☆434Updated last year
- A small and fast library for extruding 2D polygons and polylines to 3D meshes☆182Updated last year
- Javascript library for 2d geometry☆561Updated last month
- Easy to use robust Delaunay triangulation☆158Updated 10 years ago
- A very fast 2D concave hull algorithm in JavaScript☆652Updated 2 years ago
- Robust and fast 2D convex hull☆47Updated 2 years ago