tektosyneThe Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Stars: ✭ 52 (-37.35%)
inpolyA fast 'point(s)-in-polygon' test for MATLAB.
Stars: ✭ 17 (-79.52%)
WagyuA general library for geometry operations of union, intersections, difference, and xor
Stars: ✭ 116 (+39.76%)
GeokdbushThe fastest spatial index for geographic locations in JavaScript
Stars: ✭ 251 (+202.41%)
SimplificationVery fast LineString simplification using RDP or Visvalingam-Whyatt and a Rust binary
Stars: ✭ 78 (-6.02%)
HxgeomalgoSmall collection of computational geometry algorithms in Haxe.
Stars: ✭ 133 (+60.24%)
homog2dC++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
Stars: ✭ 70 (-15.66%)
MeltAutomatic conservative mesh occluder generation by box filling
Stars: ✭ 105 (+26.51%)
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 (-84.34%)
FlatbushA very fast static spatial index for 2D points and rectangles in JavaScript
Stars: ✭ 1,031 (+1142.17%)
CgalThe public CGAL repository, see the README below
Stars: ✭ 2,825 (+3303.61%)
Aabb TreeA d-dimensional aabb-tree implementation for MATLAB.
Stars: ✭ 5 (-93.98%)
RbushRBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Stars: ✭ 1,881 (+2166.27%)
geojson-rbushGeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Stars: ✭ 60 (-27.71%)
Turf SwiftA Swift language port of Turf.js.
Stars: ✭ 123 (+48.19%)
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 (+1862.65%)
Lazysets.jlA Julia package for calculus with convex sets
Stars: ✭ 107 (+28.92%)
DelaunatorAn incredibly fast JavaScript library for Delaunay triangulation of 2D points
Stars: ✭ 1,641 (+1877.11%)
homeCommunity for parametric furniture designs.
Stars: ✭ 44 (-46.99%)
VisibilitySimple sweep line visibility polygon algorithm implementation
Stars: ✭ 62 (-25.3%)
Delaunator CppA really fast C++ library for Delaunay triangulation of 2D points
Stars: ✭ 244 (+193.98%)
PolysnapA work in progress polygon operations library with integer snap-rounding
Stars: ✭ 14 (-83.13%)
rdpA library providing FFI access to fast Ramer–Douglas–Peucker and Visvalingam-Whyatt line simplification algorithms
Stars: ✭ 20 (-75.9%)
KdbushA fast static index for 2D points
Stars: ✭ 412 (+396.39%)
DlibAllocators, I/O streams, math, geometry, image and audio processing for D
Stars: ✭ 182 (+119.28%)
QhullQhull development for www.qhull.org -- Qhull 8.0.2 (2020.2 candidate) at https://github.com/qhull/qhull/wiki
Stars: ✭ 400 (+381.93%)
CdtC++ library for constrained Delaunay triangulation (CDT)
Stars: ✭ 165 (+98.8%)
bentley-ottmannsimple Java implementation of Bentley-Ottmann sweep line algorithm for listing all intersections in a set of line segments
Stars: ✭ 16 (-80.72%)
Cavaliercontours2D polyline library for offsetting, combining, etc.
Stars: ✭ 135 (+62.65%)
Data structure and algorithms libraryA collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming
Stars: ✭ 133 (+60.24%)
convhull 3dA header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Stars: ✭ 108 (+30.12%)
mcutA simple and fast library for mesh booleans and more.
Stars: ✭ 57 (-31.33%)
WykobiWykobi C++ Computational Geometry Library
Stars: ✭ 115 (+38.55%)
SplashGeomOpen-source C++ library for geometry and linear algebra
Stars: ✭ 22 (-73.49%)
polliwog2D and 3D computational geometry library
Stars: ✭ 22 (-73.49%)
MartinezMartinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Stars: ✭ 391 (+371.08%)
EarcutThe fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Stars: ✭ 1,359 (+1537.35%)
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 (+43.37%)
SuperclusterA very fast geospatial point clustering library for browsers and Node.
Stars: ✭ 1,246 (+1401.2%)
polytopeGeometric operations on polytopes of any dimension
Stars: ✭ 51 (-38.55%)
Bru 9Aesthetic Engine 2
Stars: ✭ 74 (-10.84%)
ProjectsA list of awesome open source projects Vladimir Agafonkin is involved in.
Stars: ✭ 250 (+201.2%)
EuclidExact Computation Geometry Framework Based on 'CGAL'
Stars: ✭ 52 (-37.35%)
Polytri🔺 Fast and simple polygon triangulation library.
Stars: ✭ 37 (-55.42%)
Skeleton TracingA new algorithm for retrieving topological skeleton as a set of polylines from binary images
Stars: ✭ 241 (+190.36%)
Pympc Stars: ✭ 26 (-68.67%)
SDLPSeidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
Stars: ✭ 36 (-56.63%)
TurfA modular geospatial engine written in JavaScript
Stars: ✭ 6,659 (+7922.89%)
IsectSegments intersection detection library
Stars: ✭ 199 (+139.76%)
HmmHeightmap meshing utility.
Stars: ✭ 403 (+385.54%)
venn7A musical interface based on symmetric 7-set Venn diagrams
Stars: ✭ 29 (-65.06%)
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 (+112.05%)
polyclipR package polyclip: a port of the Clipper library for polygon geometry
Stars: ✭ 18 (-78.31%)
MidcurveNNComputation of Midcurve of Thin Polygons using Neural Networks
Stars: ✭ 19 (-77.11%)
polygon-splitterA small (<10kb minified) javascript library for splitting polygons by a polyline.
Stars: ✭ 20 (-75.9%)
topoA Geometry library for Elixir that calculates spatial relationships between two geometries
Stars: ✭ 125 (+50.6%)
Robust PredicatesFast robust predicates for computational geometry in JavaScript
Stars: ✭ 170 (+104.82%)