computational-geometry

#算法刷题#A modular geospatial engine written in JavaScript and TypeScript

#算法刷题#The public CGAL repository, see the README below

#算法刷题#RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles

#算法刷题#An incredibly fast JavaScript library for Delaunay triangulation of 2D points

#算法刷题#The fastest and smallest JavaScript polygon triangulation library for your WebGL apps

#算法刷题#A very fast geospatial point clustering library for browsers and Node.

Resources on the topic of digital morphogenesis (creating form with code). Includes links to major articles, code repos, creative projects, books, software, and more.

The JTS Topology Suite is a Java library for creating and manipulating vector geometry.

Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, ...

#算法刷题#A very fast static spatial index for 2D points and rectangles in JavaScript 🌱

Must-read and classic books of computational geometry and computer graphics

Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...

Constrained Delaunay Triangulation (C++)

Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki

Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor

Object-oriented pure Python B-Spline and NURBS library

#算法刷题#A fast static index for 2D points

Heightmap meshing utility.

#算法刷题#A really fast C++ library for Delaunay triangulation of 2D points

#算法刷题#A new algorithm for retrieving topological skeleton as a set of polylines from binary images