GeokdbushThe fastest spatial index for geographic locations in JavaScript
ProjectsA list of awesome open source projects Vladimir Agafonkin is involved in.
Delaunator CppA really fast C++ library for Delaunay triangulation of 2D points
Skeleton TracingA new algorithm for retrieving topological skeleton as a set of polylines from binary images
CgalThe public CGAL repository, see the README below
IsectSegments intersection detection library
DlibAllocators, I/O streams, math, geometry, image and audio processing for D
GreinerhormannGreiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clipping areas. ~3kb footprint, no dependencies
CdtC++ library for constrained Delaunay triangulation (CDT)
RbushRBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
HxgeomalgoSmall collection of computational geometry algorithms in Haxe.
GoslLinear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, optimisation, differential equations.
WagyuA general library for geometry operations of union, intersections, difference, and xor
WykobiWykobi C++ Computational Geometry Library
Lazysets.jlA Julia package for calculus with convex sets
DelaunatorAn incredibly fast JavaScript library for Delaunay triangulation of 2D points
MeltAutomatic conservative mesh occluder generation by box filling
EarcutThe fastest and smallest JavaScript polygon triangulation library for your WebGL apps
SuperclusterA very fast geospatial point clustering library for browsers and Node.
SimplificationVery fast LineString simplification using RDP or Visvalingam-Whyatt and a Rust binary
VisibilitySimple sweep line visibility polygon algorithm implementation
EuclidExact Computation Geometry Framework Based on 'CGAL'
FlatbushA very fast static spatial index for 2D points and rectangles in JavaScript
Polytri🔺 Fast and simple polygon triangulation library.
PolysnapA work in progress polygon operations library with integer snap-rounding
Aabb TreeA d-dimensional aabb-tree implementation for MATLAB.
TurfA modular geospatial engine written in JavaScript
KdbushA fast static index for 2D points
HmmHeightmap meshing utility.
QhullQhull development for www.qhull.org -- Qhull 8.0.2 (2020.2 candidate) at https://github.com/qhull/qhull/wiki
MartinezMartinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
WordsandbuttonsA growing collection of interactive tutorials, demos, and quizzes about maths, algorithms, and programming.
Computational GeometryComputational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
Nurbs PythonObject-oriented pure Python B-Spline and NURBS library
Grassmann.jl⟨Leibniz-Grassmann-Clifford⟩ differential geometric algebra / multivector simplicial complex
GeometryBoost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
GeopythonNotebooks and libraries for spatial/geo Python explorations
HootenannyHootenanny conflates multiple maps into a single seamless map.
Mapillary JsInteractive, customizable street imagery viewer in the browser, powered by WebGL
DgtalDigital Geometry Tools and Algorithm Library
pyobbOBB implementation in python (using numpy)
bitpitOpen source library for scientific HPC
PGSProcessing Geometry Suite
LimberGridViewLimberGridView, a powerful JavaScript Library using Computational Geometry to render movable, dynamically resizable, and auto-arranging grids. Written in vanilla JavaScript, it can be plugged into most frameworks, plus it has a plugin for React applications. It gives users the most optimal arrangements using its highly efficient and fine-tuned a…
gproshangeometry processing and shape analysis framework
point-in-polygon-haoA point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
polyclipR package polyclip: a port of the Clipper library for polygon geometry
polytopeGeometric operations on polytopes of any dimension
MidcurveNNComputation of Midcurve of Thin Polygons using Neural Networks
mcutA simple and fast library for mesh booleans and more.
homeCommunity for parametric furniture designs.
SDLPSeidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables