Expand description
A mesh partitioning library that implements multithreaded, composable geometric algorithms.
Crate Layout
Coupe exposes a Partition trait, which is in turn implemented by
algorithms. See its documentation for more details. The trait is generic around its input, which means algorithms
can partition different type of collections (e.g. 2D and 3D meshes).
Available algorithms
Partitioner algorithms
- Space filling curves:
- Recursive Coordinate Bisection
- Recursive Inertial Bisection
- Multi jagged
- Number partitioning:
- Greedy
- Karmarkar-Karp and its complete version
Partition improving algorithms
- K-means
- Number partitioning:
- Fiduccia-Mattheyses
- Kernighan-Lin
Modules
Structs
Complete Karmarkar-Karp algorithm
FiducciaMattheyses
Diagnostic data for a Fiduccia-Mattheyses run.
Graph Growth algorithm
Greedy number partitioning algorithm
Hilbert space-filling curve algorithm
K-means algorithm
Karmarkar-Karp algorithm
KernighanLin algorithm
Multi-Jagged algorithm
Map elements to parts randomly.
Recursive Coordinate Bisection algorithm
A floating-point value that cannot be NAN nor infinity.
Recursive Inertial Bisection algorithm
Steepest descent Vector-of-Numbers algorithm
Descent Vector-of-Numbers algorithm
Z space-filling curve algorithm
Enums
Common errors thrown by algorithms.
Traits
Trait alias for values accepted as weights by CompleteKarmarkarKarp.
Trait alias for values accepted as weights by FiducciaMattheyses.
Trait alias for values accepted as weights by Greedy.
Trait alias for values accepted as weights by KarmarkarKarp.
The Partition trait allows for partitioning data.
Trait alias for values accepted as weights by VnBest.
Trait alias for values accepted as weights by VnFirst.