earcutr
Triangulator
An implementation of Earcut triangulation algorithm in Rust for polygon triangulation and verification.
Port of MapBox's earcut triangulation code to Rust language
41 stars
6 watching
6 forks
Language: Rust
last commit: almost 3 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| Fast triangulation of polygons | 5 | |
| A fast and efficient polygon triangulation algorithm with support for complex shapes and holes | 871 | |
| A fast and small JavaScript polygon triangulation library for WebGL applications. | 2,227 | |
| A Rust port of a C++ library for calculating Constrained Delaunay Triangulation on polygons | 15 | |
| A fast and robust Rust library for Delaunay triangulation of 2D points | 211 | |
| An algorithm for decomposing polygons into triangles, specifically designed to handle self-intersecting shapes. | 3 | |
| A V port of earcut algorithm for computing polygon hole indices and deviations | 14 | |
| A Rust library providing efficient and robust algorithms for creating 2D Delaunay triangulations. | 277 | |
| A library for 2D triangulation of polygons and lines with support for GPU translation | 36 | |
| A software library for computing Delaunay triangulations of 2.5D points with elevation data | 34 | |
| A fast C++ library for Delaunay triangulation of 2D points | 0 | |
| A Rust library implementing point-in-polygon geometry calculations | 2 | |
| Provides an implementation of elliptic curve arithmetic and associated cryptographic primitives. | 910 | |
| A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets | 147 | |
| Fast approximations of geodesic measurements in Rust | 9 |