morishuz/delaunay32
View on GitHub ↗ ★ 194 C++
Fast, parallel 2D Delaunay triangulation using exact integer predicates
3 mentions on Hacker News by 3 people: 1 story, 2 comments · first 2026-07-31 · latest 2026-10-22
20082026
-
…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…
comment by morishuz · 2026-10-22 · in Faster than earcut: triangulating 3.7M map polygons in 489 ms -
…requires 128-bit multiplication, in some rare degenerate cases. In this repo the incircle is here: https://github.com/morishuz/delaunay32/blob/141d979b18e296ac...
comment by delusional · 2026-08-06 · in Exact, parallel 2D Delaunay triangulation for int32 coordinates