Delaunator-GDScript
Triangulation algorithm
A fast algorithm for triangulating 2D points into Delaunay triangles
A GDScript port of Delaunator: A fast library for Delaunay triangulation of 2D points.
81 stars
6 watching
9 forks
Language: GDScript
last commit: over 2 years agoLinked from 1 awesome list
2dalgorithmcomputational-geometrydelaunatordelaunayfastgdscriptmapboxtriangulation
godotengine/awesome-godotRelated projects:
| Repository | Description | Stars |
|---|---|---|
 ashwin/gdel3d | A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets | 147 |
 mourner/delaunator-rs | A fast and robust Rust library for Delaunay triangulation of 2D points | 211 |
 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 |
 artem-ogre/cdt | A C++ library for generating constrained or conforming Delaunay triangulations with robust and efficient algorithms | 1,099 |
 dengwirda/jigsaw-matlab | Provides MATLAB bindings for generating high-quality triangulations and polyhedral decompositions of general planar, surface, and volumetric domains. | 75 |
 fil/d3-geo-voronoi | Computes spherical Delaunay triangulation and Voronoi diagrams from 3D point data | 239 |
 yonaba/delaunay | A Lua module for computing Delaunay triangulations of convex polygons | 108 |
 shuoli84/poly2tri-rs | A Rust port of a C++ library for calculating Constrained Delaunay Triangulation on polygons | 15 |
 pemn/vtk_triangulate_points | Creates simplified surfaces from dense point clouds using either Delaunay or grid triangulation methods | 10 |
 stoeoef/spade | A Rust library providing efficient and robust algorithms for creating 2D Delaunay triangulations. | 277 |
 mapbox/earcut.hpp | A fast and efficient polygon triangulation algorithm with support for complex shapes and holes | 871 |
 sungiant/abacus | A cross-precision 3D maths library with deterministic implementations of common data types across various precisions. | 45 |
 acheul/louvre | An algorithm for decomposing polygons into triangles, specifically designed to handle self-intersecting shapes. | 3 |
 hypertidy/geodist | A lightweight package for calculating geodesic distances between points on the Earth's surface | 95 |