/usr/include/gmsh/meshMetric.h is in libgmsh-dev 2.8.5+dfsg-1.1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 | // Gmsh - Copyright (C) 1997-2014 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to the public mailing list <gmsh@geuz.org>.
#ifndef _MESH_METRIC_H_
#define _MESH_METRIC_H_
#include <map>
#include <algorithm>
#include "STensor3.h"
#include "Field.h"
#include "meshGFaceOptimize.h"
template <class scalar> class simpleFunction;
class MVertex;
class gLevelset;
class MElementOctree;
class STensor3;
/**Anisotropic mesh size field based on a metric */
class meshMetric: public Field {
public:
typedef enum {LEVELSET=1,HESSIAN=2, FREY=3, EIGENDIRECTIONS=4, EIGENDIRECTIONS_LINEARINTERP_H=5,
ISOTROPIC_LINEARINTERP_H=6} MetricComputationTechnique;
private:
// intersect all metrics added in "setOfMetrics", preserve eigendirections of the "most anisotropic" metric
void updateMetrics();
int _dim;
double _epsilon, _E, _E_moins, _Np;
bool needMetricUpdate;
bool hasAnalyticalMetric;
meshMetric::MetricComputationTechnique _technique;
double hmin, hmax;
simpleFunction<double> *_fct;
std::vector<MElement*> _elements;
v2t_cont _adj;
MElementOctree *_octree;
std::map<int, MVertex*> _vertexMap;
std::map<MVertex*,double> vals;
std::map<MVertex*,SVector3> grads;
std::map<MVertex*,SMetric3> hessians;
public:
typedef std::map<MVertex*,SMetric3> nodalMetricTensor;
typedef std::map<MVertex*,double> nodalField;
private:
nodalMetricTensor _nodalMetrics;
nodalField _nodalSizes, _detMetric;
std::map<int,nodalMetricTensor> setOfMetrics;
std::map<int,nodalField> setOfSizes;
std::map<int,bool> setOfRecomputeBoolean;
std::map<int,simpleFunction<double>* > setOfFcts;
std::map<int,std::vector<double> > setOfParameters;
std::map<int,int > setOfTechniques;
// std::map<int,nodalField> setOfDetMetric;
public:
meshMetric(std::vector<MElement*> elements);
meshMetric(GModel *gm);
~meshMetric();
// compute a new metric and add it to the set of metrics
// parameters[1] = lcmin (default : in global gmsh options CTX::instance()->mesh.lcMin)
// parameters[2] = lcmax (default : in global gmsh options CTX::instance()->mesh.lcMax)
// Available algorithms ("techniques"):
// 1: fct is a LS, metric based on Coupez technique
// parameters[0] = thickness of the interface (mandatory)
// 2: metric based on the hessian of fct
// parameters[0] = the final number of elements
// 3: fct is a LS, variant of (1) based on Frey technique (combines Coupez and curvature)
// parameters[0] = thickness of the interface (mandatory)
// parameters[3] = the required minimum number of elements to represent a circle - used for curvature-based metric (default: = 15)
// 4: fct is a LS, variant of (3), metric computed in LS eigendirections
// parameters[0] = thickness of the interface in the positive ls direction (mandatory)
// parameters[4] = thickness of the interface in the negative ls direction (default: =parameters[0] if not specified)
// parameters[3] = the required minimum number of elements to represent a circle - used for curvature-based metric (default: = 15)
// 5: same as 4, except that the transition in band E uses linear interpolation of h, instead of linear interpolation of metric
// 6: fct is a LS, metric is isotropic with linear interpolation of h in band E
// 7: metric based on the Hessian of fct, scaled so that the smallest element has size lcmin
void addMetric(int technique, simpleFunction<double> *fct, std::vector<double> parameters);
inline SMetric3 metricAtVertex (MVertex* v) {
if (needMetricUpdate) updateMetrics();
return _nodalMetrics[v];
}
// this function scales the mesh metric in order
// to reach a target number of elements
void scaleMetric( int nbElementsTarget,
nodalMetricTensor &nmt );
void computeMetric(int metricNumber);
void computeMetricLevelSet(MVertex *ver, SMetric3 &hessian, SMetric3 &metric, double &size, double x=0.0, double y = 0.0, double z = 0.0);
void computeMetricHessian(MVertex *ver, SMetric3 &hessian, SMetric3 &metric, double &size, double x=0.0, double y = 0.0, double z = 0.0);
void computeMetricFrey(MVertex *ver, SMetric3 &hessian, SMetric3 &metric, double &size, double x=0.0, double y = 0.0, double z = 0.0);
void computeMetricEigenDir(MVertex *ver, SMetric3 &hessian, SMetric3 &metric, double &size, double x=0.0, double y = 0.0, double z = 0.0);
void computeMetricIsoLinInterp(MVertex *ver, SMetric3 &hessian, SMetric3 &metric, double &size, double x=0.0, double y = 0.0, double z = 0.0);
void computeValues();
void computeHessian();
double getLaplacian (MVertex *v);
SVector3 getGradient (MVertex *v) ;
virtual bool isotropic () const {return false;}
virtual const char *getName()
{
return "metricField";
}
virtual std::string getDescription()
{
return "Anisotropic size field based on hessian of a given function";
}
// get metric at point(x,y,z) (previously computes intersection of metrics if not done yet)
virtual double operator() (double x, double y, double z, GEntity *ge=0) ;
virtual void operator() (double x, double y, double z, SMetric3 &metr, GEntity *ge=0);
// export pos files of fct, fct gradients (fct is the lattest fct passed to meshMetric !!) and resulting metric (intersection of all computed metrics)
void exportInfo(const char *fileendname);
};
#endif
|