https://github.com/acgetchell/d-delaunay
D-dimensional Delauany triangulations in Rust
https://github.com/acgetchell/d-delaunay
delaunay-triangulation
Last synced: about 1 year ago
JSON representation
D-dimensional Delauany triangulations in Rust
- Host: GitHub
- URL: https://github.com/acgetchell/d-delaunay
- Owner: acgetchell
- License: bsd-3-clause
- Created: 2023-12-10T17:32:20.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-11-08T20:49:16.000Z (over 1 year ago)
- Last Synced: 2024-11-08T21:33:31.999Z (over 1 year ago)
- Topics: delaunay-triangulation
- Language: Rust
- Homepage:
- Size: 289 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Codeowners: .github/CODEOWNERS
Awesome Lists containing this project
README
# d-delaunay
[](https://github.com/acgetchell/d-delaunay/actions/workflows/ci.yml)
[](https://github.com/acgetchell/d-delaunay/actions/workflows/rust-clippy.yml)
[](https://codecov.io/gh/acgetchell/d-delaunay)
[](https://github.com/acgetchell/d-delaunay/actions/workflows/audit.yml)
[](https://app.codacy.com/gh/acgetchell/d-delaunay/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade)
D-dimensional Delaunay triangulations in [Rust], inspired by [CGAL].
## 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]
- [x] Arbitrary data types associated with vertices and cells
- [x] 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.
[Rust]: https://rust-lang.org
[CGAL]: https://www.cgal.org/
[C++]: https://isocpp.org
[Spade]: https://github.com/Stoeoef/spade
[delaunay]: https://crates.io/crates/delaunay
[JSON]: https://www.json.org/json-en.html
[Delaunay triangulations]: https://en.wikipedia.org/wiki/Delaunay_triangulation
[Constrained Delaunay triangulations]: https://en.wikipedia.org/wiki/Constrained_Delaunay_triangulation
[Voronoi diagrams]: https://en.wikipedia.org/wiki/Voronoi_diagram
[research]: https://github.com/acgetchell/cdt-rs
[traits]: https://doc.rust-lang.org/book/ch10-02-traits.html