CoMMA 1.3.2
A geometric agglomerator for unstructured meshes
|
#include <cmath>
#include <memory>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "CoMMA/Dual_Graph.h"
#include "CoMMA/Util.h"
Go to the source code of this file.
Classes | |
class | comma::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. More... | |
class | comma::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. More... | |
class | comma::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. More... | |
class | comma::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. More... | |
class | comma::ARDiamOverMinEdge< IndexT, RealT, IntT > |
ARComputer. Here, AR is the ratio of the diameter over the smallest edge. More... | |
class | comma::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. More... | |
class | comma::ARDiameter< IndexT, RealT, IntT > |
ARComputer. Here, AR is the approximated diameter. More... | |
class | comma::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. More... | |
class | comma::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). More... | |
class | comma::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. More... | |
class | comma::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. More... | |
Namespaces | |
namespace | comma |