/usr/include/gmsh/MFace.h is in libgmsh-dev 2.10.1+dfsg1-1ubuntu4.
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 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 | // Gmsh - Copyright (C) 1997-2015 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 _MFACE_H_
#define _MFACE_H_
#include <functional>
#include <vector>
#include "MVertex.h"
#include "MEdge.h"
#include "SVector3.h"
#include "GmshMessage.h"
// A mesh face.
class MFace {
private:
std::vector<MVertex *> _v;
std::vector<char> _si; // sorted indices
public:
MFace() {}
MFace(MVertex *v0, MVertex *v1, MVertex *v2, MVertex *v3=0);
MFace(const std::vector<MVertex*> v);
inline int getNumVertices() const { return (int)_v.size(); }
inline MVertex *getVertex(const int i) const { return _v[i]; }
inline MVertex *getSortedVertex(const int i) const { return _v[int(_si[i])]; }
inline MEdge getEdge(const int i) const
{
return MEdge(getVertex(i), getVertex((i + 1) % getNumVertices()));
}
bool computeCorrespondence(const MFace&,int&,bool&) const;
void getOrderedVertices(std::vector<MVertex*> &verts) const
{
for(int i = 0; i < getNumVertices(); i++)
verts.push_back(getSortedVertex(i));
}
void getOrderedVertices(const MVertex **const verts) const
{
for(int i = 0; i < getNumVertices(); i++)
verts[i] = getSortedVertex(i);
}
SVector3 normal() const;
SVector3 tangent(int num) const
{
SVector3 t0(_v[1]->x() - _v[0]->x(),
_v[1]->y() - _v[0]->y(),
_v[1]->z() - _v[0]->z());
t0.normalize();
if(!num) return t0;
SVector3 n = normal();
SVector3 t1 = crossprod(n, t0);
return t1;
}
SPoint3 barycenter() const
{
SPoint3 p(0., 0., 0.);
int n = getNumVertices();
for(int i = 0; i < n; i++) {
const MVertex *v = getVertex(i);
p[0] += v->x();
p[1] += v->y();
p[2] += v->z();
}
p[0] /= (double)n;
p[1] /= (double)n;
p[2] /= (double)n;
return p;
}
SPoint3 interpolate(const double &u, const double &v) const
{
SPoint3 p(0., 0., 0.);
int n = getNumVertices();
if(n == 3){
const double ff[3] = {1. - u - v, u, v};
for(int i = 0; i < n; i++) {
MVertex *v = getVertex(i);
p[0] += v->x() * ff[i];
p[1] += v->y() * ff[i];
p[2] += v->z() * ff[i];
}
}
else if(n == 4){
const double ff[4] = {(1 - u) * (1. - v),
(1 + u) * (1. - v),
(1 + u) * (1. + v),
(1 - u) * (1. + v)};
for(int i = 0; i < n; i++) {
MVertex *v = getVertex(i);
p[0] += v->x() * ff[i] * .25;
p[1] += v->y() * ff[i] * .25;
p[2] += v->z() * ff[i] * .25;
}
}
else
Msg::Error("Cannot interpolate inside a polygonal MFace with more than 4 edges");
return p;
}
};
inline bool operator==(const MFace &f1, const MFace &f2)
{
if(f1.getNumVertices() != f2.getNumVertices())
return false;
for(int i = 0; i < f1.getNumVertices(); i++)
if(f1.getSortedVertex(i) != f2.getSortedVertex(i))
return false;
return true;
}
inline bool operator!=(const MFace &f1, const MFace &f2)
{
if(f1.getNumVertices() != f2.getNumVertices())
return true;
for(int i = 0; i < f1.getNumVertices(); i++)
if(f1.getSortedVertex(i) != f2.getSortedVertex(i))
return true;
return false;
}
struct Equal_Face : public std::binary_function<MFace, MFace, bool> {
bool operator()(const MFace &f1, const MFace &f2) const
{
return (f1 == f2);
}
};
struct Less_Face : public std::binary_function<MFace, MFace, bool> {
bool operator()(const MFace &f1, const MFace &f2) const
{
if (f1.getNumVertices() != f2.getNumVertices())
return f1.getNumVertices() < f2.getNumVertices();
for(int i = 0; i < f1.getNumVertices(); i++) {
if(f1.getSortedVertex(i)->getNum() < f2.getSortedVertex(i)->getNum()) return true;
if(f1.getSortedVertex(i)->getNum() > f2.getSortedVertex(i)->getNum()) return false;
}
return false;
}
};
#endif
|