All Categories → Mathematics → computational-geometry

Top 75 computational-geometry open source projects

Geokdbush
The fastest spatial index for geographic locations in JavaScript
Projects
A list of awesome open source projects Vladimir Agafonkin is involved in.
Delaunator Cpp
A really fast C++ library for Delaunay triangulation of 2D points
Skeleton Tracing
A new algorithm for retrieving topological skeleton as a set of polylines from binary images
Isect
Segments intersection detection library
Greinerhormann
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
Robust Predicates
Fast robust predicates for computational geometry in JavaScript
Cdt
C++ library for constrained Delaunay triangulation (CDT)
Rbush
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Cavaliercontours
2D polyline library for offsetting, combining, etc.
Hxgeomalgo
Small collection of computational geometry algorithms in Haxe.
Gosl
Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, optimisation, differential equations.
Wagyu
A general library for geometry operations of union, intersections, difference, and xor
Wykobi
Wykobi C++ Computational Geometry Library
Lazysets.jl
A Julia package for calculus with convex sets
Delaunator
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Melt
Automatic conservative mesh occluder generation by box filling
Earcut
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Supercluster
A very fast geospatial point clustering library for browsers and Node.
Simplification
Very fast LineString simplification using RDP or Visvalingam-Whyatt and a Rust binary
Visibility
Simple sweep line visibility polygon algorithm implementation
Euclid
Exact Computation Geometry Framework Based on 'CGAL'
Flatbush
A very fast static spatial index for 2D points and rectangles in JavaScript
Polytri
🔺 Fast and simple polygon triangulation library.
Polysnap
A work in progress polygon operations library with integer snap-rounding
Aabb Tree
A d-dimensional aabb-tree implementation for MATLAB.
Turf
A modular geospatial engine written in JavaScript
Kdbush
A fast static index for 2D points
Hmm
Heightmap meshing utility.
Qhull
Qhull development for www.qhull.org -- Qhull 8.0.2 (2020.2 candidate) at https://github.com/qhull/qhull/wiki
Martinez
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Wordsandbuttons
A growing collection of interactive tutorials, demos, and quizzes about maths, algorithms, and programming.
Computational Geometry
Computational 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 Python
Object-oriented pure Python B-Spline and NURBS library
Grassmann.jl
⟨Leibniz-Grassmann-Clifford⟩ differential geometric algebra / multivector simplicial complex
Geometry
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
Hootenanny
Hootenanny conflates multiple maps into a single seamless map.
Mapillary Js
Interactive, customizable street imagery viewer in the browser, powered by WebGL
Dgtal
Digital Geometry Tools and Algorithm Library
pyobb
OBB implementation in python (using numpy)
Book-list-of-computational-geometry-and-computer-graphics
Book list of computational geometry and computer graphics 计算几何和计算机图形学必读书单与经典书籍
LimberGridView
LimberGridView, 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…
point-in-polygon-hao
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
polytope
Geometric operations on polytopes of any dimension
home
Community for parametric furniture designs.
SDLP
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
1-60 of 75 computational-geometry projects