mikolalysenko / robust-point-in-polygon
Exactly test if a point is inside, outside or on the boundary of a polygon
☆245Updated last year
Alternatives and similar repositories for robust-point-in-polygon:
Users that are interested in robust-point-in-polygon are comparing it to the libraries listed below
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆141Updated last month
- k-nearest neighbors search (KNN) for RBush☆214Updated 4 months ago
- A very fast JavaScript polyline and polygon clipping library☆174Updated 2 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆557Updated 9 months ago
- A fast static index for 2D points☆646Updated 4 months ago
- Robust and fast 2D convex hull☆47Updated 2 years ago
- Small lib for polygon offsetting(margin/padding)☆252Updated last year
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆240Updated last year
- GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles