Class lsst::afw::math::PolynomialFunction2

template<typename ReturnT>
class PolynomialFunction2 : public lsst::afw::math::BasePolynomialFunction2<ReturnT>

2-dimensional polynomial function with cross terms

f(x,y) = c0 (0th order)

• c1 x + c2 y (1st order)

• c3 x^2 + c4 x y + c5 y^2 (2nd order)

• c6 x^3 + c7 x^2 y + c8 x y^2 + c9 y^3 (3rd order)

• …

Intermediate products for the most recent y are cached, so when computing for a set of x, y it is more efficient to change x before you change y.