mikolalysenko / robust-point-in-polygon
Exactly test if a point is inside, outside or on the boundary of a polygon
☆245Updated 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
- A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polyg…☆140Updated 4 months ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆579Updated last year
- Small lib for polygon offsetting(margin/padding)☆253Updated 2 years ago
- A very fast JavaScript polyline and polygon clipping library☆174Updated 2 years ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆723Updated 8 months ago
- Clipper Abstraction (simplified API)☆125Updated 2 years ago
- Polygons intersection (JavaScript)☆57Updated 2 months ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆240Updated 2 years ago
- k-nearest neighbors search (KNN) for RBush☆217Updated 7 months ago
- Easy to use robust Delaunay triangulation☆160Updated 10 years ago
- This repository is deprecated and no longer maintained.☆592Updated 2 months ago
- output rgb or hex colormaps☆236Updated 3 years ago
- The smallest and simplest priority queue in JavaScript.☆445Updated 9 months ago
- (sparse + dynamic) 3D spatial representation structure for fast searches☆223Updated 3 years ago
- 2D constrained Delaunay triangulation☆245Updated 5 years ago
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆89Updated 7 months ago
- Any dimensional alpha shapes☆77Updated 10 years ago
- A very fast and simple JavaScript priority queue☆135Updated 3 years ago
- A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.☆69Updated 5 months ago
- A NodeJS implementation of Dijkstra's algorithm☆159Updated 2 years ago
- A JS library to find the convex hull of a finite set of 3d points☆143Updated 7 months ago
- A module to check if a polygon self-intersects☆29Updated 4 years ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆89Updated 5 years ago
- Boolean operations and offsetting library in Javascript☆187Updated last year
- Javascript library for 2d geometry☆585Updated 6 months ago
- A JavaScript tool for working with polygons.☆54Updated 8 years ago
- manipulate polygons in 2d space☆135Updated 8 years ago
- A JavaScript implementation of the Marching Squares algorithm featuring IsoContour and IsoBand computation☆161Updated 4 years ago
- Receives a Coordinate, a Radius and a Number of edges and aproximates a circle by creating a polygon that fills its area☆113Updated last month
- Robust and fast 2D convex hull☆49Updated 3 years ago