1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
// Gmsh - Copyright (C) 1997-2020 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// issues on https://gitlab.onelab.info/gmsh/gmsh/issues.
//
// Contributor(s):
// Eric Bechet
//
#ifndef QUADRATURERULES_H
#define QUADRATURERULES_H
#include "GaussIntegration.h"
#include "MElement.h"
class QuadratureBase {
public:
virtual ~QuadratureBase() {}
virtual int getIntPoints(MElement *e, IntPt **GP) = 0;
};
// For rigid contact no need of Gauss'integration
// but to use clasical get function in term npts and IntPt are needed
// so use a empty gaussQuadrature rule
class QuadratureVoid : public QuadratureBase {
public:
QuadratureVoid() : QuadratureBase() {}
~QuadratureVoid() {}
int getIntPoints(MElement *e, IntPt **GP)
{
GP = NULL;
return 0;
}
};
class GaussQuadrature : public QuadratureBase {
public:
enum IntegCases { Other, Val, Grad, ValVal, GradGrad };
private:
int order;
IntegCases info;
public:
GaussQuadrature(int order_ = 0) : order(order_), info(Other) {}
GaussQuadrature(IntegCases info_) : order(0), info(info_) {}
virtual ~GaussQuadrature() {}
virtual int getIntPoints(MElement *e, IntPt **GP)
{
int integrationOrder;
int npts;
int geoorder = e->getPolynomialOrder();
switch(info) {
case Other: integrationOrder = order; break;
case Val: integrationOrder = geoorder + 1; break;
case Grad: integrationOrder = geoorder; break;
case ValVal: integrationOrder = 2 * geoorder; break;
case GradGrad: integrationOrder = 3 * (geoorder - 1) + 1; break;
default: integrationOrder = 1;
}
e->getIntegrationPoints(integrationOrder, &npts, GP);
return npts;
}
// copy constructor
GaussQuadrature(const GaussQuadrature &other)
: order(other.order), info(other.info)
{
}
};
#endif //_QUADRATURERULES_H_
|
