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
| Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
|---|---|---|---|---|---|---|---|---|---|---|
| Greinerhormann | 186 | | 7 | 12 | 3 years ago | 10 | June 02, 2021 | 8 | mit | 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 | ||||||||||
| Simplify Geometry | 51 |  | 20 | 8 | 9 years ago | 2 | February 02, 2015 | 1 | mit | JavaScript |
| Simplify geometry using the Ramer–Douglas–Peucker algorithm. | ||||||||||
Alternatives To GreinerhormannSelect To Compare
Alternative Project Comparisons
Popular Leaflet Projects
Popular Algorithms Projects
Popular User Interface Components Categories
Related Searches
Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Javascript
Algorithms
Play Framework
Polygon
Leaflet
Computational Geometry