delaunator-rs
Triangulator
A fast and robust Rust library for Delaunay triangulation of 2D points
Fast 2D Delaunay triangulation in Rust. A port of Delaunator.
211 stars
5 watching
28 forks
Language: Rust
last commit: 6 months ago
Linked from 1 awesome list
algorithmsdelaunay-triangulationgeometryrustspatial
pka/awesome-georustRelated projects:
| Repository | Description | Stars |
|---|---|---|
 soerendd/delaunator-cpp | A fast C++ library for Delaunay triangulation of 2D points | 0 |
 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 |
 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 |
 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 |
 artem-ogre/cdt | A C++ library for generating constrained or conforming Delaunay triangulations with robust and efficient algorithms | 1,099 |
 ashwin/gdel3d | A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets | 147 |
 dengwirda/jigsaw-matlab | Provides MATLAB bindings for generating high-quality triangulations and polyhedral decompositions of general planar, surface, and volumetric domains. | 75 |
 ringsaturn/geometry-rs | A Rust library implementing point-in-polygon geometry calculations | 2 |
 open-s2/earclip | Fast triangulation of polygons | 5 |
 dps/rust-raytracer | A simple ray tracing implementation in Rust to generate 3D images with lighting, texture mapping, and parallel rendering. | 241 |
 bitshifter/glam-rs | A fast linear algebra library for games and graphics | 1,555 |
 pemn/vtk_triangulate_points | Creates simplified surfaces from dense point clouds using either Delaunay or grid triangulation methods | 10 |