There are 6 repositories under delaunay topic.
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
Constrained Delaunay Triangulation (C++)
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
C# / .NET version of Jonathan Shewchuk's Triangle mesh generator.
A system independent tool for interactive image manipulation with Voronoi and Delaunay data structures.
C# implementation of the Bowyer–Watson algorithm for Delaunay triangulation
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 analysis, path planning, natural neighbor interpolation, and other applications of Triangulated Irregular Networks (TIN)
JIGSAW is a Delaunay-based unstructured mesh generator for two- and three-dimensional geometries.
One week experiment: learn how to procedurally generate maps on a sphere. Code is messy but it runs.
A port of poly2tri to C#
A simple and lean Java implementation of an incremental 2D Delaunay triangulation algorithm.
PCGEx is a free (libre) Unreal 5 plugin that expands PCG capabilities. It offers a variety of high-performance nodes; with an edge for building relational graphs (Freeform, Delaunay, Voronoi, MST etc) and pathfinding; and much more.
A GDScript port of Delaunator: A fast library for Delaunay triangulation of 2D points.
Automatic Image Morphing
Fast Delaunay triangulation of 2D points implemented in Python.
fast layer decomposition and updating
Go wrapper for Triangle: Constrained Delaunay Triangulation and Voronoi Tesselation
Delaunay Triangulation
Create contours from non-gridded data with meandering triangles.
A Typescript library for multidimensional convex hulling and Delaunay triangulations.
Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
A really fast C++ library for Delaunay triangulation of 2D points
A Rust implementation of the Bourke Delaunay triangulation algorithm.