Pympc Stars: ✭ 26 (+62.5%)
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
Stars: ✭ 325 (+1931.25%)
GoslLinear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, optimisation, differential equations.
Stars: ✭ 1,629 (+10081.25%)
EuclidExact Computation Geometry Framework Based on 'CGAL'
Stars: ✭ 52 (+225%)
pyobbOBB implementation in python (using numpy)
Stars: ✭ 63 (+293.75%)
Cavaliercontours2D polyline library for offsetting, combining, etc.
Stars: ✭ 135 (+743.75%)
HmmHeightmap meshing utility.
Stars: ✭ 403 (+2418.75%)
Skeleton TracingA new algorithm for retrieving topological skeleton as a set of polylines from binary images
Stars: ✭ 241 (+1406.25%)
GeopythonNotebooks and libraries for spatial/geo Python explorations
Stars: ✭ 268 (+1575%)
DelaunatorAn incredibly fast JavaScript library for Delaunay triangulation of 2D points
Stars: ✭ 1,641 (+10156.25%)
Bru 9Aesthetic Engine 2
Stars: ✭ 74 (+362.5%)
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…
Stars: ✭ 51 (+218.75%)
CdtC++ library for constrained Delaunay triangulation (CDT)
Stars: ✭ 165 (+931.25%)
Polytri🔺 Fast and simple polygon triangulation library.
Stars: ✭ 37 (+131.25%)
ProjectsA list of awesome open source projects Vladimir Agafonkin is involved in.
Stars: ✭ 250 (+1462.5%)
TurfA modular geospatial engine written in JavaScript
Stars: ✭ 6,659 (+41518.75%)
Data structure and algorithms libraryA collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming
Stars: ✭ 133 (+731.25%)
MartinezMartinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Stars: ✭ 391 (+2343.75%)
SplashGeomOpen-source C++ library for geometry and linear algebra
Stars: ✭ 22 (+37.5%)
Grassmann.jl⟨Leibniz-Grassmann-Clifford⟩ differential geometric algebra / multivector simplicial complex
Stars: ✭ 289 (+1706.25%)
WykobiWykobi C++ Computational Geometry Library
Stars: ✭ 115 (+618.75%)
Mapillary JsInteractive, customizable street imagery viewer in the browser, powered by WebGL
Stars: ✭ 261 (+1531.25%)
IsectSegments intersection detection library
Stars: ✭ 199 (+1143.75%)
bitpitOpen source library for scientific HPC
Stars: ✭ 80 (+400%)
EarcutThe fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Stars: ✭ 1,359 (+8393.75%)
SimplificationVery fast LineString simplification using RDP or Visvalingam-Whyatt and a Rust binary
Stars: ✭ 78 (+387.5%)
gproshangeometry processing and shape analysis framework
Stars: ✭ 48 (+200%)
Robust PredicatesFast robust predicates for computational geometry in JavaScript
Stars: ✭ 170 (+962.5%)
VisibilitySimple sweep line visibility polygon algorithm implementation
Stars: ✭ 62 (+287.5%)
GeokdbushThe fastest spatial index for geographic locations in JavaScript
Stars: ✭ 251 (+1468.75%)
FlatbushA very fast static spatial index for 2D points and rectangles in JavaScript
Stars: ✭ 1,031 (+6343.75%)
RbushRBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Stars: ✭ 1,881 (+11656.25%)
PolysnapA work in progress polygon operations library with integer snap-rounding
Stars: ✭ 14 (-12.5%)
homog2dC++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
Stars: ✭ 70 (+337.5%)
Aabb TreeA d-dimensional aabb-tree implementation for MATLAB.
Stars: ✭ 5 (-68.75%)
HxgeomalgoSmall collection of computational geometry algorithms in Haxe.
Stars: ✭ 133 (+731.25%)
KdbushA fast static index for 2D points
Stars: ✭ 412 (+2475%)
Delaunator CppA really fast C++ library for Delaunay triangulation of 2D points
Stars: ✭ 244 (+1425%)
QhullQhull development for www.qhull.org -- Qhull 8.0.2 (2020.2 candidate) at https://github.com/qhull/qhull/wiki
Stars: ✭ 400 (+2400%)
Turf SwiftA Swift language port of Turf.js.
Stars: ✭ 123 (+668.75%)
WordsandbuttonsA growing collection of interactive tutorials, demos, and quizzes about maths, algorithms, and programming.
Stars: ✭ 328 (+1950%)
geojson-rbushGeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Stars: ✭ 60 (+275%)
Nurbs PythonObject-oriented pure Python B-Spline and NURBS library
Stars: ✭ 295 (+1743.75%)
WagyuA general library for geometry operations of union, intersections, difference, and xor
Stars: ✭ 116 (+625%)
GeometryBoost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
Stars: ✭ 282 (+1662.5%)
CgalThe public CGAL repository, see the README below
Stars: ✭ 2,825 (+17556.25%)
HootenannyHootenanny conflates multiple maps into a single seamless map.
Stars: ✭ 264 (+1550%)
Lazysets.jlA Julia package for calculus with convex sets
Stars: ✭ 107 (+568.75%)
DgtalDigital Geometry Tools and Algorithm Library
Stars: ✭ 259 (+1518.75%)
inpolyA fast 'point(s)-in-polygon' test for MATLAB.
Stars: ✭ 17 (+6.25%)
MeltAutomatic conservative mesh occluder generation by box filling
Stars: ✭ 105 (+556.25%)
PGSProcessing Geometry Suite
Stars: ✭ 39 (+143.75%)
DlibAllocators, I/O streams, math, geometry, image and audio processing for D
Stars: ✭ 182 (+1037.5%)
awesome-cogsciAn Awesome List of Cognitive Science Resources
Stars: ✭ 71 (+343.75%)
convhull 3dA header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Stars: ✭ 108 (+575%)
TinfourDelaunay and Constrained Delaunay Triangulations in Java, providing high-performance utilities for modeling surfaces with support for Lidar LAS files, Digital Elevation Models (DEM), finite element analysis, path planning, natural neighbor interpolation, and other applications of Triangulated Irregular Networks (TIN)
Stars: ✭ 119 (+643.75%)
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
Stars: ✭ 176 (+1000%)
SuperclusterA very fast geospatial point clustering library for browsers and Node.
Stars: ✭ 1,246 (+7687.5%)