Delaunay32 is a C++17 library for fast, parallel 2D Delaunay triangulation using exact integer predicates. It targets large sets of discrete 2D points (pixels, raster samples, voxel projections) and also accepts float input via internal quantization. Key features include a Morton-ordered divide-and-conquer algorithm, constrained Delaunay triangulation, polygon domain support with holes, optional multithreading, and deterministic duplicate handling. Benchmarks show it is over 10× faster than delaunator-cpp and ~4× faster than Fade2D on one million points. The library is MIT licensed, dependency-free for core use, and ships with extras for sampling, SVG export, and JSON geometry I/O.
Table of contents
HighlightsDocumentationWhen to use itPerformanceQuick startUsageHow it worksRunning the benchmarkSVG examplesDevelopmentVersioning and releasesScopeLicense88 Impressions