43 #ifndef lumpedPointInterpolator_H 44 #define lumpedPointInterpolator_H 71 scalar weight1_, weight2_;
94 inline bool valid()
const;
100 inline label
next()
const;
103 inline label
next1()
const;
106 inline label
next2()
const;
123 inline void nearest(
const label
id);
126 inline void next(
const label
id,
const scalar weight);
scalar weight2() const
The weighting for the second neighbour point, this also corresponds to the logical location (interval...
scalar weight1() const
The weighting for the first neighbour point, this also corresponds to the logical location (interval ...
label next2() const
The second neighbour control point, or -1 if invalid.
~lumpedPointInterpolator()=default
Destructor.
T interpolate(const UList< T > &input) const
Linear interpolated value between nearest and next locations.
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.
Templated 2D Barycentric derived from VectorSpace. Has 3 components, one of which is redundant...
A simple linear interpolator between two locations, which are referenced by index.
A triangular face using a FixedList of labels corresponding to mesh vertices.
static Istream & input(Istream &is, IntRange< T > &range)
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
bool valid() const
Valid if there is an associated nearest point.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
scalar weight0() const
The weighting for the nearest point.
label next() const
The first neighbour control point - identical to next1()