Expand description
§dcel
Dynamic doubly-connected edge list (DCEL) in Rust.
A DCEL is a topological data structure that represents an embedding of a planar graph in the plane. DCEL partitions a surface into easily and quickly traversable vertices, edges, and faces, while making only minimal assumptions about their shapes. You can freely choose wherever the vertices should have two or more dimensions, or wheverer the edges are line segments or curved arcs.
In mathematics, particularly in topological graph theory and algebraic graph theory, planar graph embeddings in the plane are represented using concepts such as cellularly embedded graph, ribbon graph, band decomposition, ram graph, arrow presentation, signed rotation system.
§Usage
§Adding dependency
First, add dcel as a dependency to your Cargo.toml
[dependencies]
dcel = "0.8"§Documentation
See the documentation for more information
about dcel’s usage.
§Packaging
dcel is published as a crate on the
Crates.io registry.
§Contributing
We welcome issues and pull requests from anyone to our canonical repository on Codeberg.
§Licence
§Outbound licence
dcel is dual-licensed as under either of
at your option.
§Inbound licence
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in this work by you will be dual-licensed as described above, without any additional terms or conditions.
Structs§
- Dcel
- A doubly-connected edge list (DCEL).
- EdgeId
- A unique identifier to an edge made of an ascendingly sorted pair of half-edge ids.
- Face
- The data which describes a face.
- FaceId
- An index pointing to a face.
- Half
Edge - The data which describes a half-edge.
- Half
Edge Id - An index pointing to a half-edge.
- Half
Spokes Iter - Half
Spokes Reverse Iter - Half
Spokes Reverse Walker - Half
Spokes Walker - Spokes
Iter - Spokes
Reverse Iter - Spokes
Reverse Walker - Spokes
Walker - Vertex
- The data which describes a vertex.
- Vertex
Id - An index pointing to a vertex.