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☆179Updated 3 weeks ago
- Small lib for polygon offsetting(margin/padding)☆261Updated 2 years ago
- output rgb or hex colormaps☆238Updated 3 years 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
- This repository is deprecated and no longer maintained.☆591Updated 6 months 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
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆145Updated this week
- k-nearest neighbors search (KNN) for RBush☆223Updated 10 months ago
- Density Based Clustering in JavaScript☆222Updated 6 years ago
- JavaScript k-d Tree Implementation☆651Updated last year
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆71Updated 8 months ago
- 2D constrained Delaunay triangulation☆253Updated 6 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆589Updated last year
- interpolate for X in a 2d array☆99Updated 2 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆90Updated 11 months ago
- A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic☆134Updated 6 years ago
- Segments intersection detection library☆279Updated 5 months ago
- manipulate polygons in 2d space☆135Updated 8 years ago
- A fast static index for 2D points☆666Updated this week
- Easy to use robust Delaunay triangulation☆160Updated 11 years ago
- Any dimensional alpha shapes☆77Updated 10 years ago
- gets miter normals for a 2D polyline☆139Updated last year
- 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…☆738Updated 3 weeks 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☆173Updated 4 years ago
- Chaikin's smoothing algorithm for 2D polylines☆89Updated 7 years ago
- Polygons intersection (JavaScript)☆54Updated 6 months ago
- A static kdtree data structure☆310Updated 4 years ago