mikolalysenko / robust-point-in-polygonLinks
Exactly test if a point is inside, outside or on the boundary of a polygon
☆248Updated 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☆182Updated last month
- output rgb or hex colormaps☆239Updated 3 years ago
- Small lib for polygon offsetting(margin/padding)☆261Updated 2 years ago
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆146Updated 3 weeks ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆73Updated 9 months ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆243Updated 2 years ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆92Updated 5 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆592Updated last year
- k-nearest neighbors search (KNN) for RBush☆225Updated 11 months ago
- manipulate polygons in 2d space☆135Updated 8 years ago
- 2D constrained Delaunay triangulation☆253Updated 6 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆173Updated 4 years ago
- JavaScript k-d Tree Implementation☆652Updated last year
- Any dimensional alpha shapes☆78Updated 10 years ago
- Robust and fast 2D convex hull☆51Updated 3 years ago
- Chaikin's smoothing algorithm for 2D polylines☆89Updated 7 years ago
- A fast static index for 2D points☆670Updated 3 weeks ago
- This repository is deprecated and no longer maintained.☆591Updated 6 months ago
- A static kdtree data structure☆310Updated 4 years ago
- A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic☆134Updated 6 years ago
- Turns a text string into a 2D poly line☆317Updated last year
- interpolate for X in a 2d array☆99Updated 2 years ago
- Density Based Clustering in JavaScript☆223Updated 6 years ago
- The smallest and simplest priority queue in JavaScript.☆458Updated last year
- Geometric operations for two-dimensional polygons.☆98Updated last year
- A JavaScript tool for working with polygons.☆54Updated 8 years ago
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- gets miter normals for a 2D polyline☆139Updated last year
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆302Updated 9 years ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆740Updated last month