Fast, parallel 2D Delaunay triangulation using exact integer predicates, with direct float input. Delaunay32 is a C++17 library for triangulating large sets of discrete 2D points: pixels, raster samples, voxel projections, fixed-point geometry, and other quantized spatial data. Finite float points can also be passed directly; the library quantizes them internally while output indices continue to reference the original coordinates. It combines exact integer predicates with a Morton-ordered divide-and-conquer algorithm, compact two-dart topology, and optional multithreading. The result is a triangulator that is deterministic, robust, and particularly fast on large point sets. For large point sets, Delaunay32 is over 10× faster than delaunator-cpp and around 4× faster than Fade2D .…