The short version
C++ polygon triangulator; a commenter recommends its fast Delaunay-refinement path for benchmarking.
From the HackerLinks archive
earcut.hpp
C++ polygon triangulator; a commenter recommends its fast Delaunay-refinement path for benchmarking.
At a glance:
First seen:2026-10-23
Last seen:2026-10-23
Times seen:1
Website:github.com
Why it caught our attention
A concrete library recommendation highlights a useful refinement capability rather than merely naming an alternative.
Where it surfaced on Hacker News
2026-10-23
“You should also try out https://github.com/mapbox/earcut.hpp for the benchmark — it got a refine function recently that refines earcut output to Delaunay as well, and earcut+refine is still pretty fast.”
mourner · recommendation
Direct HN comment
Faster than earcut: triangulating 3.7M map polygons in 489 ms