Cavaliercontours2D polyline library for offsetting, combining, etc.
Stars: ✭ 135 (+114.29%)
DelaunatorAn incredibly fast JavaScript library for Delaunay triangulation of 2D points
Stars: ✭ 1,641 (+2504.76%)
convhull 3dA header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Stars: ✭ 108 (+71.43%)
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 (+179.37%)
EuclidExact Computation Geometry Framework Based on 'CGAL'
Stars: ✭ 52 (-17.46%)
venn7A musical interface based on symmetric 7-set Venn diagrams
Stars: ✭ 29 (-53.97%)
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 (+2485.71%)
homeCommunity for parametric furniture designs.
Stars: ✭ 44 (-30.16%)
SuperclusterA very fast geospatial point clustering library for browsers and Node.
Stars: ✭ 1,246 (+1877.78%)
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 (+88.89%)
IsectSegments intersection detection library
Stars: ✭ 199 (+215.87%)
Pympc Stars: ✭ 26 (-58.73%)
CdtC++ library for constrained Delaunay triangulation (CDT)
Stars: ✭ 165 (+161.9%)
MidcurveNNComputation of Midcurve of Thin Polygons using Neural Networks
Stars: ✭ 19 (-69.84%)
Data structure and algorithms libraryA collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming
Stars: ✭ 133 (+111.11%)
bentley-ottmannsimple Java implementation of Bentley-Ottmann sweep line algorithm for listing all intersections in a set of line segments
Stars: ✭ 16 (-74.6%)
WykobiWykobi C++ Computational Geometry Library
Stars: ✭ 115 (+82.54%)
gproshangeometry processing and shape analysis framework
Stars: ✭ 48 (-23.81%)
EarcutThe fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Stars: ✭ 1,359 (+2057.14%)
SplashGeomOpen-source C++ library for geometry and linear algebra
Stars: ✭ 22 (-65.08%)
Bru 9Aesthetic Engine 2
Stars: ✭ 74 (+17.46%)
polygon-splitterA small (<10kb minified) javascript library for splitting polygons by a polyline.
Stars: ✭ 20 (-68.25%)
Polytri🔺 Fast and simple polygon triangulation library.
Stars: ✭ 37 (-41.27%)
ProjectsA list of awesome open source projects Vladimir Agafonkin is involved in.
Stars: ✭ 250 (+296.83%)
CgalThe public CGAL repository, see the README below
Stars: ✭ 2,825 (+4384.13%)
Aabb TreeA d-dimensional aabb-tree implementation for MATLAB.
Stars: ✭ 5 (-92.06%)
ELEMENTSThe C++ ELEMENTS library contains a suite of sub-libraries to support mathematical functions (elements), data representations (MATAR), and novel mesh classes (geometry and SWAGE) to support a very broad range of element types, numerical methods, and mesh connectivity data structures useful for computational physics and engineering.
Stars: ✭ 13 (-79.37%)
DlibAllocators, I/O streams, math, geometry, image and audio processing for D
Stars: ✭ 182 (+188.89%)
polytopeGeometric operations on polytopes of any dimension
Stars: ✭ 51 (-19.05%)
Robust PredicatesFast robust predicates for computational geometry in JavaScript
Stars: ✭ 170 (+169.84%)
rdpA library providing FFI access to fast Ramer–Douglas–Peucker and Visvalingam-Whyatt line simplification algorithms
Stars: ✭ 20 (-68.25%)
RbushRBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Stars: ✭ 1,881 (+2885.71%)
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 (-19.05%)
HxgeomalgoSmall collection of computational geometry algorithms in Haxe.
Stars: ✭ 133 (+111.11%)
topoA Geometry library for Elixir that calculates spatial relationships between two geometries
Stars: ✭ 125 (+98.41%)
Turf SwiftA Swift language port of Turf.js.
Stars: ✭ 123 (+95.24%)
mcutA simple and fast library for mesh booleans and more.
Stars: ✭ 57 (-9.52%)
WagyuA general library for geometry operations of union, intersections, difference, and xor
Stars: ✭ 116 (+84.13%)
geojson-rbushGeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Stars: ✭ 60 (-4.76%)
Lazysets.jlA Julia package for calculus with convex sets
Stars: ✭ 107 (+69.84%)
bitpitOpen source library for scientific HPC
Stars: ✭ 80 (+26.98%)
MeltAutomatic conservative mesh occluder generation by box filling
Stars: ✭ 105 (+66.67%)
homog2dC++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
Stars: ✭ 70 (+11.11%)
SDLPSeidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
Stars: ✭ 36 (-42.86%)
SimplificationVery fast LineString simplification using RDP or Visvalingam-Whyatt and a Rust binary
Stars: ✭ 78 (+23.81%)
inpolyA fast 'point(s)-in-polygon' test for MATLAB.
Stars: ✭ 17 (-73.02%)
VisibilitySimple sweep line visibility polygon algorithm implementation
Stars: ✭ 62 (-1.59%)
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
Stars: ✭ 83 (+31.75%)
FlatbushA very fast static spatial index for 2D points and rectangles in JavaScript
Stars: ✭ 1,031 (+1536.51%)
GeokdbushThe fastest spatial index for geographic locations in JavaScript
Stars: ✭ 251 (+298.41%)
PolysnapA work in progress polygon operations library with integer snap-rounding
Stars: ✭ 14 (-77.78%)
tektosyneThe Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Stars: ✭ 52 (-17.46%)
Delaunator CppA really fast C++ library for Delaunay triangulation of 2D points
Stars: ✭ 244 (+287.3%)
PGSProcessing Geometry Suite
Stars: ✭ 39 (-38.1%)
polyclipR package polyclip: a port of the Clipper library for polygon geometry
Stars: ✭ 18 (-71.43%)
polliwog2D and 3D computational geometry library
Stars: ✭ 22 (-65.08%)
Skeleton TracingA new algorithm for retrieving topological skeleton as a set of polylines from binary images
Stars: ✭ 241 (+282.54%)