A fast algorithm for finding the pole of inaccessibility of a polygon (in JavaScript and C++)
Fast point-in-polygon intersection for large numbers of polygons.
Computational Geometry library written in Rust
Rust geospatial primitives & algorithms
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Formally verified polygon intersection
Computational geometry and spatial indexing on the sphere
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
