poly2tri-rs
Polygon triangulator
A Rust port of a C++ library for calculating Constrained Delaunay Triangulation on polygons
Rust port for poly2tri cpp library
15 stars
2 watching
0 forks
Language: Rust
last commit: over 3 years agoLinked from 1 awesome list
pka/awesome-georustRelated projects:
| Repository | Description | Stars |
|---|---|---|
 mourner/delaunator-rs | A fast and robust Rust library for Delaunay triangulation of 2D points | 211 |
 open-s2/earclip | Fast triangulation of polygons | 5 |
 ringsaturn/geometry-rs | A Rust library implementing point-in-polygon geometry calculations | 2 |
 acheul/louvre | An algorithm for decomposing polygons into triangles, specifically designed to handle self-intersecting shapes. | 3 |
 frewsxcv/earcutr | An implementation of Earcut triangulation algorithm in Rust for polygon triangulation and verification. | 41 |
 urschrei/polylabel-rs | A Rust implementation of the Polylabel algorithm for finding ideal label positions on polygons | 54 |
 mapbox/earcut.hpp | A fast and efficient polygon triangulation algorithm with support for complex shapes and holes | 871 |
 soerendd/delaunator-cpp | A fast C++ library for Delaunay triangulation of 2D points | 0 |
 stoeoef/spade | A Rust library providing efficient and robust algorithms for creating 2D Delaunay triangulations. | 277 |
 hugoledoux/startin | A software library for computing Delaunay triangulations of 2.5D points with elevation data | 34 |
| mapbox/earcut | A fast and small JavaScript polygon triangulation library for WebGL applications. | 2,227 |
 ishape-rust/ioverlay | Provides high-performance operations on 2D polygons | 49 |
 baddstats/polyclip | A R package implementing a C++ polygon clipping algorithm | 19 |
 hiulit/delaunator-gdscript | A fast algorithm for triangulating 2D points into Delaunay triangles | 81 |
 ivanfratric/polypartition | A lightweight C++ library for polygon partition and triangulation with various algorithms | 666 |