Trending repositories for topic computational-geometry
A library for detecting and resolving intersections between two surface meshes.
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
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
A library for detecting and resolving intersections between two surface meshes.
A really fast C++ library for Delaunay triangulation of 2D points
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.
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 ...
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.
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
A library for detecting and resolving intersections between two surface meshes.
A really fast C++ library for Delaunay triangulation of 2D points
Resources on the topic of digital morphogenesis (creating form with code). Includes links to major articles, code repos, creative projects, books, software, and more.
Delaunay triangulations and Voronoi tessellations in two dimensions.
Nodi is an online node-based geometry design tool & social development environment.
Delaunay triangulations and Voronoi tessellations in two dimensions.
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.
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.
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
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Resources on the topic of digital morphogenesis (creating form with code). Includes links to major articles, code repos, creative projects, books, software, and more.
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 ...
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.
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
Must-read and classic books of computational geometry and computer graphics
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
A library for detecting and resolving intersections between two surface meshes.
V library to develop Artificial Intelligence and High-Performance Scientific Computations
A list of awesome open source projects Volodymyr Agafonkin is involved in.
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
Collection of Computational Geometry algorithm Implementation and simple simulations using the implementation
Delaunay triangulations and Voronoi tessellations in two dimensions.
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
Nodi is an online node-based geometry design tool & social development environment.
Detect collisions between different shapes such as Points, Lines, Boxes, Polygons (including concave), Ellipses, and Circles. Features include RayCasting and support for offsets, rotation, scaling, bo...
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
A library for detecting and resolving intersections between two surface meshes.
V library to develop Artificial Intelligence and High-Performance Scientific Computations
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
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
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 ...
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Must-read and classic books of computational geometry and computer graphics
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.
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
Nodi is an online node-based geometry design tool & social development environment.
The source code for the Geometry for Programmers book
Delaunay triangulations and Voronoi tessellations in two dimensions.
Collection of Computational Geometry algorithm Implementation and simple simulations using the implementation
Nodi is an online node-based geometry design tool & social development environment.
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 ...
Detect collisions between different shapes such as Points, Lines, Boxes, Polygons (including concave), Ellipses, and Circles. Features include RayCasting and support for offsets, rotation, scaling, bo...
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
Fast Delaunay triangulation of 2D points implemented in Python.