mikolalysenko / robust-point-in-polygonLinks
Exactly test if a point is inside, outside or on the boundary of a polygon
☆247Updated 2 years ago
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
Sorting:
- A very fast JavaScript polyline and polygon clipping library☆177Updated this week
- This repository is deprecated and no longer maintained.☆591Updated 5 months ago
- Small lib for polygon offsetting(margin/padding)☆260Updated 2 years ago
- output rgb or hex colormaps☆237Updated 3 years ago
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆143Updated 6 months ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆242Updated 2 years ago
- k-nearest neighbors search (KNN) for RBush☆222Updated 9 months ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆71Updated 7 months ago
- interpolate for X in a 2d array☆99Updated 2 years ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆92Updated 5 years ago
- Robust and fast 2D convex hull☆51Updated 3 years ago
- 2D constrained Delaunay triangulation☆250Updated 6 years ago
- gets miter normals for a 2D polyline☆139Updated last year
- A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic☆133Updated 6 years ago
- Density Based Clustering in JavaScript☆222Updated 6 years ago
- Turns a text string into a 2D poly line☆316Updated last year
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆586Updated last year
- A fast static index for 2D points☆664Updated 9 months ago
- JavaScript k-d Tree Implementation☆648Updated last year
- Any dimensional alpha shapes☆77Updated 10 years ago
- Easy to use robust Delaunay triangulation☆160Updated 11 years ago
- Chaikin's smoothing algorithm for 2D polylines☆89Updated 7 years ago
- manipulate polygons in 2d space☆135Updated 8 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆90Updated 10 months ago
- Numerical interpolation and extrapolation lib☆115Updated 4 years ago
- A static kdtree data structure☆309Updated 4 years ago
- Segments intersection detection library☆279Updated 4 months ago
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆302Updated 9 years ago
- Fast point-in-polygon intersection for large numbers of polygons.☆73Updated 3 months ago
- Polygons intersection (JavaScript)☆54Updated 5 months ago