Faster than earcut: triangulating 3.7M map polygons in 489 ms

A new algorithm called Earcut has been outperformed by a new technique, which can triangulate 3.7 million map polygons in just 489 milliseconds. The new method uses a combination of techniques, including edge flipping, hole punching, and edge merging. It has been implemented in a C++ library called G3D. The algorithm's performance has been tested on a dataset of 3.7 million polygons, where it achieved a median time of 489 ms and a 99th percentile time of 1,144 ms. The author claims that this is the first time an algorithm has achieved sub-second performance on this large of a dataset.