Fast polygon mesh library with different data structures and traits to abstract over those.
-
Updated
Dec 4, 2024 - Rust
#
half-edge-data-structure
Here are 2 public repositories matching this topic...
An implementation of a half-edge data structure (DCEL) in purely safe Rust, using ghost-cell and typed arena allocation to deal with the cyclic nature of the data structure. The goal is to provide a safe (primary priority) and performant (secondary priority) library for mesh processing in Rust.
-
Updated
Mar 25, 2024 - Rust
Improve this page
Add a description, image, and links to the half-edge-data-structure topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the half-edge-data-structure topic, visit your repo's landing page and select "manage topics."