A very fast geospatial point clustering library for browsers and Node.
-
Updated
Mar 18, 2024 - JavaScript
A very fast geospatial point clustering library for browsers and Node.
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Hootenanny conflates multiple maps into a single seamless map.
A fast static index for 2D points
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
The fastest spatial index for geographic locations in JavaScript
Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clipping areas. ~3kb footprint, no dependencies
Fast robust predicates for computational geometry in JavaScript
GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Segments intersection detection library
Community for parametric furniture designs.
Bentley-Ottman sweepline algorithm implementation in js
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
A small (<10kb minified) javascript library for splitting polygons by a polyline.
A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.
Solutions for Computational Geometry problems
Interface for the ganja.js library in Julia
Add a description, image, and links to the computational-geometry topic page so that developers can more easily learn about it.
To associate your repository with the computational-geometry topic, visit your repo's landing page and select "manage topics."