Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
- Updated
Oct 12, 2025 - Rust
Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
A fast, efficient and extremely stable 2d triangulation library for rust.
Parametric Modelling for Bevy using Truck CAD kernel.
Geometry processing library in pure rust
A Rust implementation of the Polylabel algorithm, with FFI.
Generative art. A suite of composable tools to generate, transform and visualize WKT geometries
A Rust port of the Earcut polygon triangulation library with performance in mind.
Rust implementation of Fortune's algorithm for generating Voronoi diagrams
A library providing FFI access to fast Ramer–Douglas–Peucker and Visvalingam-Whyatt line simplification algorithms
A lightweight toolkit for implicit geometry generation.
Rust bindings to the latest stable release of SFCGAL
geometric number library supporting unlimited dimensions with O(1) complexity
D-dimensional Delauany triangulations in Rust
A numerical library for working with Lie Groups and Algebras.
Computational Geometry Algorithms in Computational Theory, Showcasing Convex Hull (Graham Scan) O(nlogn), Line Segmentation Intersection O(n^2) & Point-in-Polygon O(n)
A simple library for computational geometry
[Experimental] Use the tri-mesh crate instead
Add a description, image, and links to the computational-geometry topic page so that developers can more easily learn about it.
To associate your repository with the computational-geometry topic, visit your repo's landing page and select "manage topics."