mikolalysenko / robust-point-in-polygonLinks
Exactly test if a point is inside, outside or on the boundary of a polygon
☆252Updated 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☆237Updated 3 years ago
- A very fast JavaScript polyline and polygon clipping library☆183Updated 6 months ago
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆147Updated 5 months ago
- k-nearest neighbors search (KNN) for RBush☆227Updated 2 months ago
- This repository is deprecated and no longer maintained.☆588Updated 11 months ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆94Updated last week
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆94Updated last year
- Robust and fast 2D convex hull☆52Updated 3 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆174Updated 5 years ago
- Small lib for polygon offsetting(margin/padding)☆268Updated 2 years ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆74Updated last year
- Easy to use robust Delaunay triangulation☆162Updated 11 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
- JavaScript k-d Tree Implementation☆657Updated 2 years ago
- Density Based Clustering in JavaScript☆227Updated 6 years ago
- A 2D rectangular bin packing data structure that uses the Shelf Best Height Fit heuristic☆136Updated 7 years ago
- Any dimensional alpha shapes☆79Updated 10 years ago
- interpolate for X in a 2d array☆100Updated 2 years ago
- Turns a text string into a 2D poly line☆318Updated last year
- manipulate polygons in 2d space☆135Updated 9 years ago
- Chaikin's smoothing algorithm for 2D polylines☆90Updated 7 years ago
- Numerical interpolation and extrapolation lib☆115Updated 4 years ago
- 2D constrained Delaunay triangulation☆260Updated 6 years ago
- Simplify geometry using the Ramer–Douglas–Peucker algorithm.☆79Updated 10 years ago
- Fast point-in-polygon intersection for large numbers of polygons.☆73Updated 4 months ago
- A tiny rectangle packing JavaScript library (for sprite layouts)☆348Updated 6 months ago
- A fast static index for 2D points☆688Updated 2 months ago
- A module to check if a polygon self-intersects☆30Updated 5 years ago
- A static kdtree data structure☆311Updated 5 years ago
- (sparse + dynamic) 3D spatial representation structure for fast searches☆226Updated 4 years ago