Method Horner

src/LNLib/Algorithm/Polynomials.cpp:22–32

using namespace LNLib;

double Polynomials::Horner(int degree, const std::vector<double>& coefficients, double paramT)
{
	VALIDATE_ARGUMENT(degree > 0, "degree", "Degree must be greater than zero.");
	VALIDATE_ARGUMENT(ValidationUtils::IsValidBezier(degree, coefficients.size()), "degree", "Coefficients size equal degree plus one.");
	double result = coefficients[degree];
	for (int i = degree - 1; i >= 0; i--)
	{
		result = result * paramT + coefficients[i];
	}
	return result;
}

double Polynomials::Bernstein(int index, int degree, double paramT)
{