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:
- output rgb or hex colormaps☆239Updated 3 years ago
- A very fast JavaScript polyline and polygon clipping library☆182Updated 4 months ago
- This repository is deprecated and no longer maintained.☆588Updated 9 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 3 months ago
- Any dimensional alpha shapes☆79Updated 10 years ago
- k-nearest neighbors search (KNN) for RBush☆225Updated last week
- Small lib for polygon offsetting(margin/padding)☆262Updated 2 years ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆245Updated 2 years ago
- Robust and fast 2D convex hull☆52Updated 3 years ago
- A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic☆135Updated 6 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆172Updated 4 years ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆74Updated 11 months ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆94Updated 6 years ago
- manipulate polygons in 2d space☆135Updated 9 years ago
- 2D constrained Delaunay triangulation☆257Updated 6 years ago
- Easy to use robust Delaunay triangulation☆160Updated 11 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆93Updated last year
- gets miter normals for a 2D polyline☆141Updated last year
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- A static kdtree data structure☆310Updated 4 years ago
- Density Based Clustering in JavaScript☆226Updated 6 years ago
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆304Updated 9 years ago
- Segments intersection detection library☆280Updated 8 months ago
- A very fast 2D concave hull algorithm in JavaScript☆711Updated 4 months ago
- Turns a text string into a 2D poly line☆317Updated last year
- A JS library to find the convex hull of a finite set of 3d points☆146Updated 7 months ago
- Polygons intersection (JavaScript)☆54Updated 9 months ago
- Chaikin's smoothing algorithm for 2D polylines☆89Updated 7 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆606Updated last year
- A fast static index for 2D points☆678Updated this week