Trending repositories for topic computational-geometry
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
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
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
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
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
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 really fast C++ library for Delaunay triangulation of 2D points
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
Nodi is an online node-based geometry design tool & social development environment.
Interactive, extendable street imagery map experiences in the browser, powered by WebGL
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
PicoGK is a compact and robust geometry kernel for Computational Engineering
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 ...
A really fast C++ 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
Interactive, extendable street imagery map experiences in the browser, powered by WebGL
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
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
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 really fast C++ 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
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
A library for detecting and resolving intersections between two surface meshes.
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 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.
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
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.
[T-RO] Highway RoadMap (HRM) paradigm for robot motion planning based on parameterizations of the free space
A really fast C++ library for Delaunay triangulation of 2D points
A library for detecting and resolving intersections between two surface meshes.
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
Develop a 3D interactive graphics rendering engine
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
Collection of Computational Geometry algorithm Implementation and simple simulations using the implementation
DelaunayTriangulation.jl: A Julia package for Delaunay triangulations and Voronoi tessellations in the plane
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.
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
PicoGK is a compact and robust geometry kernel for Computational Engineering
DelaunayTriangulation.jl: A Julia package for Delaunay triangulations and Voronoi tessellations in the plane
The source code for the Geometry for Programmers book
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.
Points, Lines, Boxes, Polygons (also hollow), Ellipses, Circles. RayCasting, offsets, rotation, scaling, bounding box padding, flags for static and ghost/trigger bodies
C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.
Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables
Fast Delaunay triangulation of 2D points implemented in Python.