delaunay32

awesome. the performance improvements looks impressive! i’m the author of Delaunay32, a constrained delaunay triangulator with polygon and hole support. it uses divide-and-conquer rather than incremental insertion, so im curious how it would compare with the delaunay baseline here. https://github.com/morishuz/delaunay32 i havent benchmarked on your corpus yet, and our current polygon api requires simple rings with non-touching holes. thanks for publishing the datasets, they look useful for testing and comparison!

Triangulation usually requires an incicrle operation at some point, and that requires doing multiplication on the result of multiplication, without loss of precision. 32-bit triangulation therefore requires 128-bit multiplication, in some rare degenerate cases. In this repo the incircle is here: https://github.com/morishuz/delaunay32/blob/141d979b18e296ac...