Computational Geometry examples, some algorithms implementations, to learn Rust
-
Updated
Apr 24, 2017 - Rust
Computational Geometry examples, some algorithms implementations, to learn Rust
[Experimental] Use the tri-mesh crate instead
Computational Geometry Algorithms in Rust
Genetic algorithm that solves the 2D rectangle knapsack problem. Try to fit as many rectangular items as possible inside a container, while maximizing the total value the items provide.
A Rust 2D computational geometry library
Data structures and algorithms for common computation geometry problems in 2D.
Rust implementation of Fortune's algorithm for generating Voronoi diagrams
A Minimal Circle Problem visualizer using the nannou toolkit.
A simple library for computational geometry
A numerical library for working with Lie Groups and Algebras.
Rust bindings to the latest stable release of SFCGAL
A library providing FFI access to fast Ramer–Douglas–Peucker and Visvalingam-Whyatt line simplification algorithms
FFI Bindings for the rust-polyline crate
Geometry processing library in pure rust
A computational geometry library to validate 2-manifold meshes for 3D printing applications. Built in Rust with Nalgebra
Parametric Modelling for Bevy using Truck CAD kernel.
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."