Compute generic 2D line intersections
-
Updated
Dec 7, 2023 - Rust
Compute generic 2D line intersections
S-Hull Delaunay triangulation implemented in Rust (with Python bindings)
A tool to create pretty triangular mesh representations of images.
A port of https://github.com/ivanfratric/polypartition to Rust
An implementation of the Bowyer–Watson algorithm to iteratively construct a Delaunay triangulation
A Rust port of the Earcut polygon triangulation library.
A Rust implementation of the Bourke Delaunay triangulation algorithm.
port of MapBox's earcut triangulation code to Rust language
Add a description, image, and links to the triangulation topic page so that developers can more easily learn about it.
To associate your repository with the triangulation topic, visit your repo's landing page and select "manage topics."