1 unstable release
new 0.1.1 | Mar 27, 2025 |
---|
#627 in Algorithms
110KB
2K
SLoC
d-delaunay
D-dimensional Delaunay triangulations in Rust, inspired by CGAL. A fork of d-delaunay.
Introduction
This library implements d-dimensional Delaunay triangulations in Rust. It is inspired by CGAL, which is a C++ library for computational geometry; and Spade, a Rust library implementing 2D Delaunay triangulations, Constrained Delaunay triangulations, and Voronoi diagrams. The eventual goal of this library is to provide a lightweight alternative to CGAL for the Rust ecosystem.
Features
- d-dimensional Delaunay triangulations
- Arbitrary data types associated with vertices and cells
- Serialization/Deserialization of all data structures to/from JSON
At some point I may merge into another library, such as Spade or delaunay, but for now I am developing this to use in my research without trying to figure out how to mesh with other libraries and coding conventions, and with the minimum number of traits to do generic computational geometry.
Dependencies
~9MB
~173K SLoC