triangolatte
Triangulator
A library for 2D triangulation of polygons and lines with support for GPU translation
2D triangulation library. Allows translating lines and polygons (both based on points) to the language of GPUs.
36 stars
5 watching
3 forks
Language: Go
last commit: about 5 years agoLinked from 2 awesome lists
computational-geometrygolangtriangulation
avelino/awesome-go
xwjdsh/awesome-go-extraRelated projects:
| Repository | Description | Stars |
|---|---|---|
 acheul/louvre | An algorithm for decomposing polygons into triangles, specifically designed to handle self-intersecting shapes. | 3 |
 mapbox/earcut.hpp | A fast and efficient polygon triangulation algorithm with support for complex shapes and holes | 871 |
 open-s2/earclip | Fast triangulation of polygons | 5 |
| mapbox/earcut | A fast and small JavaScript polygon triangulation library for WebGL applications. | 2,227 |
 pemn/vtk_triangulate_points | Creates simplified surfaces from dense point clouds using either Delaunay or grid triangulation methods | 10 |
 hugoledoux/startin | A software library for computing Delaunay triangulations of 2.5D points with elevation data | 34 |
 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 |
 ashwin/gdel3d | A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets | 147 |
 toineheuvelmans/metron | A comprehensive collection of geometric functions and types that simplify complex geometric calculations | 1,036 |
 shuoli84/poly2tri-rs | A Rust port of a C++ library for calculating Constrained Delaunay Triangulation on polygons | 15 |
 hiulit/delaunator-gdscript | A fast algorithm for triangulating 2D points into Delaunay triangles | 81 |
 frewsxcv/earcutr | An implementation of Earcut triangulation algorithm in Rust for polygon triangulation and verification. | 41 |
 artem-ogre/cdt | A C++ library for generating constrained or conforming Delaunay triangulations with robust and efficient algorithms | 1,099 |
 mint-lab/triangulationtoolbox | An open-source toolbox implementing algorithms and benchmarks for landmark-based localization in robotics. | 24 |