louvre
Polygon triangulator
An algorithm for decomposing polygons into triangles, specifically designed to handle self-intersecting shapes.
Rust library for computational geometry: plans to include handling polygons, lines and points, and some basic operations.
3 stars
1 watching
0 forks
Language: Rust
last commit: 8 months ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| A fast and efficient polygon triangulation algorithm with support for complex shapes and holes | 871 |
| Fast triangulation of polygons | 5 |
| A Rust port of a C++ library for calculating Constrained Delaunay Triangulation on polygons | 15 |
| A library for 2D triangulation of polygons and lines with support for GPU translation | 36 |
| A fast and small JavaScript polygon triangulation library for WebGL applications. | 2,227 |
| A fast and robust Rust library for Delaunay triangulation of 2D points | 211 |
| Generates new polygon shapes by shrinking or expanding existing ones | 11 |
| An implementation of Earcut triangulation algorithm in Rust for polygon triangulation and verification. | 41 |
| A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets | 147 |
| A software library for computing Delaunay triangulations of 2.5D points with elevation data | 34 |
| A small Rust crate for computing the offset contour, perimeter, and area of a given polygon with a specified margin. | 1 |
| An algorithm for finding the most distant internal point of a polygon from its outline, useful for labeling | 1,445 |
| Provides high-performance operations on 2D polygons | 49 |
| Creates simplified surfaces from dense point clouds using either Delaunay or grid triangulation methods | 10 |
| A Rust library providing efficient and robust algorithms for creating 2D Delaunay triangulations. | 277 |