Trending repositories for topic computational-geometry
Must-read and classic books of computational geometry and computer graphics
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
A library for detecting and resolving intersections between two surface meshes.
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao
Must-read and classic books of computational geometry and computer graphics
A library for detecting and resolving intersections between two surface meshes.
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
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
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
A library for detecting and resolving intersections between two surface meshes.
A really fast C++ library for Delaunay triangulation of 2D points
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
PicoGK is a compact and robust geometry kernel for Computational Engineering
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
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
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
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
[CVPR2023 Highlight] Marching-Primitives: Shape Abstraction from Signed Distance Function
A Geometry library for Elixir that calculates spatial relationships between two geometries
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
A library for detecting and resolving intersections between two surface meshes.
PicoGK is a compact and robust geometry kernel for Computational Engineering
[CVPR2023 Highlight] Marching-Primitives: Shape Abstraction from Signed Distance Function
A really fast C++ library for Delaunay triangulation of 2D points
A Geometry library for Elixir that calculates spatial relationships between two geometries
Delaunay 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 an...
Must-read and classic books of computational geometry and computer graphics
A collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming
Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
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
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
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 fastest and smallest JavaScript polygon triangulation library for your WebGL apps
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
A very fast geospatial point clustering library for browsers and Node.
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
A really fast C++ library for Delaunay triangulation of 2D points
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
A library for detecting and resolving intersections between two surface meshes.
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
Resources on the topic of digital morphogenesis (creating form with code). Includes links to major articles, code repos, creative projects, books, software, and more.
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
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
The source code for the Geometry for Programmers book
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
[T-RO] Highway RoadMap (HRM) paradigm for robot motion planning based on parameterizations of the free space
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
A library for detecting and resolving intersections between two surface meshes.
A really fast C++ library for Delaunay triangulation of 2D points
Nodi is an online node-based geometry design tool & social development environment.
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 library for detecting and resolving intersections between two surface meshes.
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
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
Fast Delaunay triangulation of 2D points implemented in Python.