mikolalysenko / robust-point-in-polygonLinks
Exactly test if a point is inside, outside or on the boundary of a polygon
☆251Updated 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☆183Updated 5 months ago
- Small lib for polygon offsetting(margin/padding)☆266Updated 2 years ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆247Updated last month
- Robust and fast 2D convex hull☆52Updated 3 years ago
- k-nearest neighbors search (KNN) for RBush☆228Updated last month
- manipulate polygons in 2d space☆135Updated 9 years ago
- output rgb or hex colormaps☆237Updated 3 years ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆94Updated last week
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆147Updated 4 months ago
- A fast static index for 2D points☆683Updated last month
- This repository is deprecated and no longer maintained.☆588Updated 10 months ago
- Any dimensional alpha shapes☆79Updated 10 years ago
- gets miter normals for a 2D polyline☆143Updated 2 years ago
- Chaikin's smoothing algorithm for 2D polylines☆90Updated 7 years ago
- interpolate for X in a 2d array☆100Updated 2 years ago
- JavaScript k-d Tree Implementation☆653Updated 2 years ago
- 2D constrained Delaunay triangulation☆259Updated 6 years ago
- Fast point-in-polygon intersection for large numbers of polygons.☆73Updated 4 months ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆94Updated last year
- Easy to use robust Delaunay triangulation☆160Updated 11 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆613Updated last year
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆74Updated last year
- A static kdtree data structure☆311Updated 5 years ago
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- A JavaScript tool for working with polygons.☆54Updated 8 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆172Updated 5 years ago
- Density Based Clustering in JavaScript☆226Updated 6 years ago
- A very fast 2D concave hull algorithm in JavaScript☆719Updated 5 months ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆754Updated 3 weeks ago
- Polygons intersection (JavaScript)☆54Updated 11 months ago