Fast, header-only polygon triangulation
A fast, header-only C++ port of earcut.js, the fastest and smallest JavaScript polygon triangulation library. Earcut favors raw speed and simplicity over triangulation quality, while being robust enough to handle most practical datasets without crashing or producing garbage, with an option to refine the result to Delaunay quality at a small cost. Originally built for Mapbox GL, it’s a good fit for real-time triangulation of geographical shapes and other practical data. It implements a modified ear slicing algorithm, optimized by z-order curve and spatial hashing and extended to handle holes, twisted polygons, degeneracies and self-intersections in a way that doesn’t guarantee correctness of triangulation, but attempts to always produce acceptable results for practical data. It’s based on ideas from FIST: Fast Industrial-Strength Triangulation of Polygons by Martin Held and Triangulation by Ear Clipping by David Eberly.
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 3.2.4-2.fc46 | - |
| Fedora 45 | 3.2.4-2.fc45 | 3.2.4-2.fc45 |
| Fedora 44 | 2.2.4-23.fc44 | - |
| Fedora 43 | 2.2.4-21.fc43 | - |
| Fedora EPEL 9 | 2.2.4-8.el9 | - |
| Fedora EPEL 8 | 2.2.4-4.el8 | - |
| Fedora EPEL 10.4 | 2.2.4-15.el10_0 | - |
| Fedora EPEL 10.3 | 2.2.4-15.el10_0 | - |
| Fedora EPEL 10.2 | 2.2.4-15.el10_0 | - |
You can contact the maintainers of this package via email at
earcut-hpp dash maintainers at fedoraproject dot org.