Trending repositories for topic computational-geometry
PicoGK is a compact and robust geometry kernel for Computational Engineering
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, ...
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
PicoGK is a compact and robust geometry kernel for Computational Engineering
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, ...
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Must-read and classic books of computational geometry and computer graphics
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Nodi is an online node-based geometry design tool & social development environment.
PicoGK is a compact and robust geometry kernel for Computational Engineering
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
A list of awesome open source projects Volodymyr Agafonkin is involved in.
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, ...
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
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 fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Nodi is an online node-based geometry design tool & social development environment.
PicoGK is a compact and robust geometry kernel for Computational Engineering
Must-read and classic books of computational geometry and computer graphics
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
A list of awesome open source projects Volodymyr Agafonkin is involved in.
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
Linear algebra, eigenvalues, FFT, Bessel, elliptic, orthogonal polys, geometry, NURBS, numerical quadrature, 3D transfinite interpolation, random numbers, Mersenne twister, probability distributions, ...
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
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 fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Nodi is an online node-based geometry design tool & social development environment.
PicoGK is a compact and robust geometry kernel for Computational Engineering
A very fast geospatial point clustering library for browsers and Node.
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Must-read and classic books of computational geometry and computer graphics
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
A library for detecting and resolving intersections between two surface meshes.
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Nodi is an online node-based geometry design tool & social development environment.
PicoGK is a compact and robust geometry kernel for Computational Engineering
Delaunay triangulations and Voronoi tessellations in two dimensions.
Collection of Computational Geometry algorithm Implementation and simple simulations using the implementation
detecting collisions between bodies: Points, Lines, Boxes, Polygons (Concave too), Ellipses and Circles. Also RayCasting. All bodies can have offset, rotation, scale, bounding box padding, can be stat...
The source code for the Geometry for Programmers book
A library for detecting and resolving intersections between two surface meshes.
Fast Delaunay triangulation of 2D points implemented in Python.
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
V library to develop Artificial Intelligence and High-Performance Scientific Computations
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
PicoGK is a compact and robust geometry kernel for Computational Engineering
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 ...
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
A very fast geospatial point clustering library for browsers and Node.
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
PicoGK is a compact and robust geometry kernel for Computational Engineering
Resources on the topic of digital morphogenesis (creating form with code). Includes links to major articles, code repos, creative projects, books, software, and more.
A library for detecting and resolving intersections between two surface meshes.
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
A really fast C++ library for Delaunay triangulation of 2D points
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
The source code for the Geometry for Programmers book
A really fast C++ library for Delaunay triangulation of 2D points
Delaunay triangulations and Voronoi tessellations in two dimensions.
[CVPR2023 Highlight] Marching-Primitives: Shape Abstraction from Signed Distance Function
Collection of Computational Geometry algorithm Implementation and simple simulations using the implementation
A library for detecting and resolving intersections between two surface meshes.
detecting collisions between bodies: Points, Lines, Boxes, Polygons (Concave too), Ellipses and Circles. Also RayCasting. All bodies can have offset, rotation, scale, bounding box padding, can be stat...
Nodi is an online node-based geometry design tool & social development environment.
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.