Delaunay32: 10x Faster Exact Delaunay Triangulation for Large Point Sets
Exact, parallel 2D Delaunay triangulation for int32 coordinates
Delaunay32 is a C++17 library for fast, parallel 2D Delaunay triangulation using exact integer predicates. It handles large sets of discrete points (pixels, raster samples, fixed-point geometry) and accepts float input directly, quantizing internally while preserving original coordinates. Benchmarks show it is over 10× faster than delaunator-cpp and about 4× faster than Fade2D on one million points. Features include constrained Delaunay, polygon support with holes, deterministic duplicates handling, and optional multithreading. The library is MIT-licensed and dependency-free.
For large point sets, Delaunay32 is over 10× faster than delaunator-cpp and around 4× faster than Fade2D.