... | @@ -36,13 +36,13 @@ weights, and the sum of the cut edges is minimal (_Find optimal decomposition_). |
... | @@ -36,13 +36,13 @@ weights, and the sum of the cut edges is minimal (_Find optimal decomposition_). |
|
the decomposition can be post-process further more to be for optimal, based on factors not considered by the optimization process, like merging vertex to create bigger sub-domains.
|
|
the decomposition can be post-process further more to be for optimal, based on factors not considered by the optimization process, like merging vertex to create bigger sub-domains.
|
|
Even if a model decomposition it is not bind to a graph model it is true that until now is the main approach
|
|
Even if a model decomposition it is not bind to a graph model it is true that until now is the main approach
|
|
|
|
|
|
* [CartDecomposition](doxygen/openfpm_pdata/classCartDecomposition.html)
|
|
* [CartDecomposition](http://ppmcore.mpi-cbg.de/doxygen/openfpm_pdata/classCartDecomposition.html)
|
|
|
|
|
|
## Fixed decomposition
|
|
## Fixed decomposition
|
|
|
|
|
|
The decomposition is chosen by the user and kept fixed.
|
|
The decomposition is chosen by the user and kept fixed.
|
|
|
|
|
|
* [CartDecomposition](doxygen/openfpm_pdata/classCartDecomposition.html)
|
|
* [CartDecomposition](http://ppmcore.mpi-cbg.de/doxygen/openfpm_pdata/classCartDecomposition.html)
|
|
|
|
|
|
## Data Driven decomposition
|
|
## Data Driven decomposition
|
|
|
|
|
... | | ... | |