mikolalysenko / robust-point-in-polygonLinks
Exactly test if a point is inside, outside or on the boundary of a polygon
☆250Updated 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 4 months ago
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆146Updated 4 months ago
- output rgb or hex colormaps☆239Updated 3 years ago
- Small lib for polygon offsetting(margin/padding)☆263Updated 2 years ago
- This repository is deprecated and no longer maintained.☆588Updated 10 months ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆246Updated last week
- k-nearest neighbors search (KNN) for RBush☆227Updated 3 weeks ago
- Density Based Clustering in JavaScript☆226Updated 6 years ago
- manipulate polygons in 2d space☆135Updated 9 years ago
- A fast static index for 2D points☆680Updated 3 weeks ago
- Robust and fast 2D convex hull☆52Updated 3 years ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆74Updated last year
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆94Updated 6 years ago
- A static kdtree data structure☆310Updated 4 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆173Updated 5 years ago
- The smallest and simplest priority queue in JavaScript.☆460Updated 3 weeks ago
- Chaikin's smoothing algorithm for 2D polylines☆90Updated 7 years ago
- gets miter normals for a 2D polyline☆141Updated 2 years ago
- A very fast 2D concave hull algorithm in JavaScript☆715Updated 4 months ago
- A JavaScript tool for working with polygons.☆54Updated 8 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆611Updated last year
- 2D constrained Delaunay triangulation☆258Updated 6 years ago
- JavaScript k-d Tree Implementation☆653Updated 2 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆94Updated last year
- Any dimensional alpha shapes☆79Updated 10 years ago
- Segments intersection detection library☆280Updated 9 months ago
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆750Updated last week
- A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic☆135Updated 6 years ago
- Numerical interpolation and extrapolation lib☆115Updated 4 years ago