Trending repositories for topic computational-geometry
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 ...
PicoGK is a compact and robust geometry kernel for Computational Engineering
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
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 ...
Must-read and classic books of computational geometry and computer graphics
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
PicoGK is a compact and robust geometry kernel for Computational Engineering
Must-read and classic books of computational geometry and computer graphics
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 ...
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
⟨Grassmann-Clifford-Hodge⟩ multilinear differential geometric algebra
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
PicoGK is a compact and robust geometry kernel for Computational Engineering
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
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 ...
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
⟨Grassmann-Clifford-Hodge⟩ multilinear differential geometric algebra
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
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
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
A very fast geospatial point clustering library for browsers and Node.
A really fast C++ library for Delaunay triangulation of 2D points
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
A library for detecting and resolving intersections between two surface meshes.
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
PicoGK is a compact and robust geometry kernel for Computational Engineering
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
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
Develop a 3D interactive graphics rendering engine
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
Must-read and classic books of computational geometry and computer graphics
A really fast C++ library for Delaunay triangulation of 2D points
[CVPR2023 Highlight] Marching-Primitives: Shape Abstraction from Signed Distance Function
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Points, Lines, Boxes, Polygons (also hollow), Ellipses, Circles. RayCasting, offsets, rotation, scaling, bounding box padding, flags for static and ghost/trigger bodies
PicoGK is a compact and robust geometry kernel for Computational Engineering
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
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
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
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 very fast geospatial point clustering library for browsers and Node.
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
A library for detecting and resolving intersections between two surface meshes.
A really fast C++ library for Delaunay triangulation of 2D points
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
PicoGK is a compact and robust geometry kernel for Computational Engineering
The source code for the Geometry for Programmers book
DelaunayTriangulation.jl: A Julia package for Delaunay triangulations and Voronoi tessellations in the plane
Nodi is an online node-based geometry design tool & social development environment.
Collection of Computational Geometry algorithm Implementation and simple simulations using the implementation
A library for detecting and resolving intersections between two surface meshes.
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
Points, Lines, Boxes, Polygons (also hollow), Ellipses, Circles. RayCasting, offsets, rotation, scaling, bounding box padding, flags for static and ghost/trigger bodies
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
