earclip
Triangulator
Fast triangulation of polygons
Triangle mesh designed to be fast, efficient, and sphere capable.
4 stars
1 watching
1 forks
Language: Rust
last commit: 2 days ago
Linked from 1 awesome list
pka/awesome-georustRelated projects:
| Repository | Description | Stars |
|---|---|---|
 mapbox/earcut.hpp | A fast and efficient polygon triangulation algorithm with support for complex shapes and holes | 865 |
 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 |
 shuoli84/poly2tri-rs | A Rust port of a C++ library for calculating Constrained Delaunay Triangulation on polygons | 15 |
| mapbox/earcut | A fast and small JavaScript polygon triangulation library for WebGL applications. | 2,218 |
 tchayen/triangolatte | A library for 2D triangulation of polygons and lines with support for GPU translation | 36 |
 ashwin/gdel3d | A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets | 145 |
 mourner/delaunator-rs | A fast and robust Rust library for Delaunay triangulation of 2D points | 210 |
 soerendd/delaunator-cpp | A fast C++ library for Delaunay triangulation of 2D points | 0 |
 yangyangyang127/pointclip_v2 | This project presents a 3D learning framework leveraging CLIP and GPT to improve performance in open-world scenarios | 232 |
 speps/libtessdotnet | A C# port of the GLU Tessellator library for generating polygons from complex shapes | 316 |
 hiulit/delaunator-gdscript | A fast algorithm for triangulating 2D points into Delaunay triangles | 81 |
 tudelft3d/prepair | A tool for automatically repairing broken GIS polygons using constrained triangulation. | 115 |
 memononen/libtess2 | A polygon tesselator and triangulator refactored to improve performance and usability | 468 |
 baddstats/polyclip | A R package implementing a C++ polygon clipping algorithm | 19 |