mikolalysenko / robust-point-in-polygon
Exactly test if a point is inside, outside or on the boundary of a polygon
☆244Updated last year
Related projects ⓘ
Alternatives and complementary repositories for robust-point-in-polygon
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆121Updated last year
- Small lib for polygon offsetting(margin/padding)☆251Updated last year
- output rgb or hex colormaps☆225Updated 2 years ago
- JavaScript k-d Tree Implementation☆642Updated 11 months ago
- k-nearest neighbors search (KNN) for RBush☆212Updated last month
- A very fast 2D concave hull algorithm in JavaScript☆652Updated 2 years ago
- A fast static index for 2D points☆635Updated last month
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆239Updated last year
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆551Updated 6 months ago
- A very fast JavaScript polyline and polygon clipping library☆173Updated 2 years ago
- The fastest spatial index for geographic locations in JavaScript☆341Updated 3 months ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆701Updated 3 months ago
- Polygons intersection (JavaScript)☆56Updated 10 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 small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆67Updated 3 months ago
- A JavaScript tool for working with polygons.☆53Updated 7 years ago
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆287Updated 8 years ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆82Updated 5 years ago
- Robust and fast 2D convex hull☆47Updated 2 years ago
- 2D constrained Delaunay triangulation☆239Updated 5 years ago
- Density Based Clustering in JavaScript☆216Updated 5 years ago
- A module to check if a polygon self-intersects☆29Updated 4 years ago
- (sparse + dynamic) 3D spatial representation structure for fast searches☆223Updated 2 years ago
- Easy to use robust Delaunay triangulation☆158Updated 10 years ago
- simple tile utilities☆257Updated last month
- NOTE: The viewport-mercator-project repo is archived and code has moved to☆139Updated 5 years ago
- A static kdtree data structure☆308Updated 3 years ago
- gets miter normals for a 2D polyline☆132Updated 11 months ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆153Updated 3 years ago