 |
CoMMA 1.3.2
A geometric agglomerator for unstructured meshes
|
|
CoMMA 1.3.2
A geometric agglomerator for unstructured meshes
|
| Ccomma::AgglomerationArgs< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Convenient class holding arguments for the parametrization of the agglomeration algorithm |
| ▼Ccomma::Agglomerator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | A class responsible to do the interface between the different kinds of agglomerator |
| Ccomma::Agglomerator_Anisotropic< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Agglomerator_Anisotropic class is a child class of the Agglomerator class that specializes the implementation to the case of Anisotropic agglomeration |
| ▼Ccomma::Agglomerator_Isotropic< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Agglomerator_Isotropic class is a child class of the Agglomerator class that specializes the implementation to the case of Isotropic agglomeration |
| ▼Ccomma::Agglomerator_Biconnected< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Child class of Agglomerator_Isotropic where is implemented a specific biconnected algorithm for the agglomeration. We call it biconnected case, but it is the greedy algorithm in reality |
| Ccomma::Agglomerator_Iterative< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Child class of Agglomerator_Isotropic which implements a specialized iterative algorithm for the search of fine cells |
| Ccomma::AnisotropicArgs< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Convenient class holding arguments for the parametrization of the anisotropic agglomeration algorithm |
| ▼Ccomma::ARComputer< IndexT, RealT, IntT > | Similar to a functor, the key point is the method that computes the AR and update the features of a cell. Here, AR is used lightly, and might be any quantity which should be minimized in the coarsening process. This is an abstract class |
| Ccomma::ARDiamOverMinEdge< IndexT, RealT, IntT > | ARComputer. Here, AR is the ratio of the diameter over the smallest edge |
| Ccomma::ARDiamOverRadius< IndexT, RealT, IntT, dim > | ARComputer. Here, AR is the ratio of the diameter over the estimated one (typically, in 2D, the squared root of the surface). It is the definition used in CoMMA from 1.1 up to 1.3.2 |
| Ccomma::ARDiameter< IndexT, RealT, IntT > | ARComputer. Here, AR is the approximated diameter |
| Ccomma::ARExternalWeightOverRadius< IndexT, RealT, IntT, dim > | ARComputer. Here, AR is the ratio of the external weights over the measure. With dim equal to 2, it is roughly equivalent to the ration of the perimeter and the surface of the cell. Moreover, with dim = 2, it is equivalent to the definition used by CoMMA up to version 1.0. For an algebraic version (where no concern is given to adimensionalize the AR), use dim equal to 1 |
| Ccomma::ARExternalWeights< IndexT, RealT, IntT > | ARComputer. Here, AR is the total external weights (that is, from a geometric point of view, the perimeter). Looking for the minimum leads in graph terms to a min-cut |
| Ccomma::ARMaxBaryDistanceOverRadius< IndexT, RealT, IntT, dim > | ARComputer. Here, AR is the ratio of the maximum over minimum distance of the cell centers from the barycenter (computed as weighted average of centers). If a cell is totally internal, it won't be included in the computations |
| Ccomma::ARMaxOverMinBaryDistance< IndexT, RealT, IntT > | ARComputer. Here, AR is the ratio of the maximum over minimum distance of the cell centers from the barycenter (computed as weighted average of centers). If a cell is totally internal, it won't be included in the computations |
| Ccomma::AROverInternalWeights< IndexT, RealT, IntT > | ARComputer. Here, AR is one over the internal weights (looking for the minimum leads to the maximization of the internal weights) |
| Ccomma::AROverMeasure< IndexT, RealT, IntT > | ARComputer. Here, AR is the reciprocal of the measure, hence the optimal solution should be the one with the max measure |
| Ccomma::Bimap< A, B > | An easy and straight forward implementation of a Bimap |
| Ccomma::CellFeatures< IndexT, RealT, IntT > | Convenient class containing salient features of a cell. According to to the chosen AR computation (see ARComputer), some features may be outdated |
| ▼Ccomma::Coarse_Cell< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class describing a coarse cell |
| Ccomma::Coarse_Cell_Subgraph< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class describing a coarse cell with a full description, that is, it also holds a subgraph describing how the fine cells are connected inside the coarse one |
| Ccomma::Coarse_Cell_Container< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class implementing a custom container where the coarse cells are stored |
| Ccomma::CustomPairGreaterFunctor< PairT > | Functor for pairs implementing a custom 'greater than'. It relies on the 'greater than' operator for the second elements and 'less than' for the first ones |
| Ccomma::CustomPairLessFunctor< PairT > | Functor for pairs implementing a custom 'less than'. It relies on the 'less than' operator for the second elements and 'greater than' for the first ones |
| ▼Ccomma::Graph< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | An interface class responsible of storing the cell centered dual graph and of acting on it (it is an interface for the global Dual_Graph and the Subgraph) |
| Ccomma::Dual_Graph< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | A class implementing the CRS global graph representation of the global mesh |
| Ccomma::Subgraph< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | A class implementing the CRS subgraph representation. It is used in the framework of CoMMA for the implementation of the CSR representation of the coarse cells |
| Ccomma::GraphArgs< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Convenient class holding arguments defining the graph |
| ▼Ccomma::Neighbourhood< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class representing the neighbourhood of a given cell in the graph. Mind that no information about the element being already agglomerated or not is known here |
| Ccomma::Neighbourhood_Extended< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class representing the neighbourhood of a given cell in the graph. In this derived class the neighbourhood is extended, meaning that all the neighbours seen so far are candidates |
| Ccomma::Neighbourhood_Pure_Front< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class representing the neighbourhood of a given cell in the graph. In this derived class, the neighbourhood is 'pure front-advancing', meaning that the next candidates are only the direct neighbours of the last added cell |
| ▼Ccomma::NeighbourhoodCreator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Pure abstract class for a creator of Neighbourhood objects. It can create from scratch or by copy |
| Ccomma::NeighbourhoodExtendedCreator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Creator of Neighbourhood_Extended objects. It can create from scratch or by copy |
| Ccomma::NeighbourhoodPureFrontCreator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Creator of Neighbourhood_Extended objects. It can create from scratch or by copy |
| Ccomma::Node< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Node data structure that represent a node of the tree |
| Ccomma::PairFindFirstBasedFunctor< PairT > | Functor implementing an operator telling if a given value if the first one of pair |
| Ccomma::PairSecondBasedLessFunctor< PairT > | Functor for pairs implementing a less operator based only on the second element of the pair |
| Ccomma::Priority_Pair< A, B > | Wrapper around the STL pair with custom 'less than' operator: as in the standard case, first we compare the first elements, then the second ones; however it relies on the 'greater than' on the first elements, e.g., (4,X) < (3,Y), whereas standard rules apply to second elements, e.g., (4,3) < (4,4) |
| Ccomma::Queue< T > | A template class implementing a custom queue data structure |
| ▼Ccomma::Seeds_Pool< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class representing the pool of all the seeds for creating a coarse cell |
| Ccomma::Seeds_Pool_Boundary_Priority< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class representing the pool of all the seeds for creating a coarse cell. This derived class gives higher priority to cells that are on the border |
| Ccomma::Seeds_Pool_Neighbourhood_Priority< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Class representing the pool of all the seeds for creating a coarse cell. This derived class gives higher priority to cells that are neighbours of already existing coarse cells |
| ▼Ccomma::SPInitializator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Functor performing the initialization of a seeds pool |
| Ccomma::SPFullInitializator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Functor performing the full initialization of a seeds pool |
| Ccomma::SPOnePointInitializator< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Functor performing the one-point initialization of a seeds pool |
| Ccomma::Tree< CoMMAIndexType, CoMMAWeightType, CoMMAIntType > | Tree structure that represent a coarse cell, the fine cell and the neighbours to them |
1.9.5