4#include <MRPch/MREigenCore.h>
18 return 1 <= degree && degree <= 4;
29template <
typename T,
size_t degree>
32 static constexpr size_t n = degree + 1;
33 Eigen::Vector<T, n>
a;
35 template <
typename NewT>
50template <
size_t degree>
53template <
size_t degree>
74 template <
size_t degree>
90template <
typename T,
size_t degree>
105 static constexpr size_t n = degree + 1;
107 Eigen::Matrix<T, n, n> XtX_;
108 Eigen::Vector<T, n> XtY_;
112template <
size_t degree>
115template <
size_t degree>
#define MRMESH_API
Definition MRMesh/MRMeshFwd.h:46
Definition MRBestFitPolynomial.h:92
MRMESH_API void addPoint(T x, T y)
MRMESH_API BestFitPolynomial(T reg)
MRMESH_API void addPoint(T x, T y, T weight)
MRMESH_API Polynomial< T, degree > getBestPolynomial() const
Definition MRCameraOrientationPlugin.h:8
constexpr bool canMinimizePolynomial(auto degree)
Definition MRBestFitPolynomial.h:21
constexpr bool canSolvePolynomial(auto degree)
Definition MRBestFitPolynomial.h:16
std::variant< Polynomial< T, 0 >, Polynomial< T, 1 >, Polynomial< T, 2 >, Polynomial< T, 3 >, Polynomial< T, 4 >, Polynomial< T, 5 >, Polynomial< T, 6 > > Polynomialx
Definition MRBestFitPolynomial.h:58
This is a unifying interface for a polynomial of some degree, known only in runtime.
Definition MRBestFitPolynomial.h:71
PolynomialWrapper(const Polynomial< T, degree > &p)
Definition MRBestFitPolynomial.h:75
MRMESH_API PolynomialWrapper< T > deriv() const
Polynomialx< T > poly
Definition MRBestFitPolynomial.h:72
MRMESH_API std::optional< T > intervalMin(T a, T b) const
MRMESH_API T operator()(T x) const
Definition MRBestFitPolynomial.h:31
static constexpr size_t n
Definition MRBestFitPolynomial.h:32
MRMESH_API T intervalMin(T a, T b) const
MRMESH_API T operator()(T x) const
Polynomial< NewT, degree > cast() const
Definition MRBestFitPolynomial.h:36
MRMESH_API Polynomial< T, degree==0 ? 0 :degree - 1 > deriv() const
Eigen::Vector< T, n > a
Definition MRBestFitPolynomial.h:33
MRMESH_API std::vector< T > solve(T tol) const