34 return -
alphaPhiU(subPointsU_, subPoints_);
38 return alphaPhiU(subPointsU_, subPoints_);
43 template<
class VectorList,
class Po
intList>
46 const VectorList& pointsU,
47 const PointList& points
50 const point& baseP = points[0];
51 const vector& baseU = pointsU[0];
54 for(
label i=1; i < points.size()-1; ++i)
57 const vector area = (points[i] - baseP) ^ (points[i + 1] - baseP);
61 alphaPhiU += (baseU + pointsU[i] + pointsU[i + 1]) & area;
69 template<
class VectorList,
class Po
intList>
72 const VectorList& pointsU,
73 const PointList& points,
77 const point& baseP = points[f[0]];
78 const vector& baseU = pointsU[f[0]];
81 for(
label i=1; i < f.size()-1; ++i)
84 const vector area = (points[f[i]] - baseP) ^ (points[f[i + 1]] - baseP);
88 alphaPhiU += (baseU + pointsU[f[i]] + pointsU[f[i + 1]]) & area;
127 if (subPoints_.size() == 3)
129 return (1.0/3.0)*(subPoints_[0] + subPoints_[1] + subPoints_[2]);
138 pAvg += subPoints_[
pi];
140 pAvg /= subPoints_.size();
153 const point& pNext = subPoints_[subPoints_.fcIndex(
pi)];
155 const vector a = (pNext -
p)^(pAvg - p);
156 const vector c = p + pNext + pAvg;
158 const scalar an = a & sumAHat;
169 return (1.0/3.0)*sumAnc/sumAn;
const vector Sf() const
Return subface surface area vector.
#define forAll(list, i)
Loop across all elements in list.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
const vector Cf(const vector &area) const
Return subface centre.
const DynamicList< point > & cutPoints() const
Access to cut points.
const DynamicList< label > & cutEdges() const
Access to cut edges.
static vector area(const PointField &ps)
Return vector area given face points.
const dimensionedScalar c
Speed of light in a vacuum.
Form normalised(const VectorSpace< Form, Cmpt, Ncmpts > &vs)
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects...
const DynamicList< point > & subPoints() const
Access to submerged face points.
scalar alphaPhiU() const
Calculate and return alphaPhiU.