50 return nearest_ != -1;
80 return scalar(1) - weight1_ - weight2_;
109 if (weight < scalar(0))
113 else if (weight > scalar(1))
132 if (weight < scalar(0))
136 else if (weight > scalar(1))
164 weight1_ = weights[1];
165 weight2_ = weights[2];
176 else if (next1_ == -1 || next1_ == nearest_)
178 return input[nearest_];
183 input[nearest_] * (1-weight1_-weight2_)
184 +
input[next1_] * (weight1_)
185 +
input[next2_] * (weight2_)
Templated 2D Barycentric derived from VectorSpace. Has 3 components, one of which is redundant.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
A simple linear interpolator between two locations, which are referenced by index.
bool valid() const
Valid if there is an associated nearest point.
scalar weight0() const
The weighting for the nearest point.
label next2() const
The second neighbour control point, or -1 if invalid.
lumpedPointInterpolator()
Default construct, with zero weighting and invalid ids.
label nearest() const
The nearest control point, or -1 if invalid.
label next1() const
The first neighbour control point, or -1 if invalid.
label next() const
The first neighbour control point - identical to next1()
bool interpolate() const noexcept
Same as isPointData()
A triangular face using a FixedList of labels corresponding to mesh vertices.
bool set() const
Are all the vector set.
static Istream & input(Istream &is, IntRange< T > &range)
static constexpr const zero Zero
Global zero (0)