docs: public boolean solvePolynomial( double f1, double f2 , double a , Double b , double c , double d )
  	{
  		double f1_2 = f1*f1;
  		double f1_4 = f1_2*f1_2;
  		double f2_2 = f2*f2;
  		double f2_4 = f2_2*f2_2;
  		double a_2 = a*a;
  		double b_2 = b*b;
  		double c_2 = c*c;
  		double d_2 = d*d;
  		double b_3 = b_2*b;
  		double d_3 = d_2*d;
  		double a_4 = a_2*a_2;
  		double b_4 = b_2*b_2;
  		double c_4 = c_2*c_2;
  		double d_4 = d_2*d_2;
  
  		poly.size = 6;
  		poly.c[5] = a*b*c_2*f1_4 - a_2*c*d*f1_4;
  		poly.c[4] = b_2*c_2*f1_4 - a_2*d_2*f1_4 + c_4*f2_4 + 2*a_2*c_2*f2_2 + a_4;
  		poly.c[3] = 2*(3*c_2*d_2*f2_4 + b_2*c_2*f1_2 - a_2*d_2*f1_2 + b_2*c_2*f2_2 + 4*a*b*c*d*f2_2 + a_2*d_2*f2_2 + 3*a_2*b_2);
  		poly.c[2] = (4*c*d_3*f2_4 + 2*b_2*c*d*f1_2 - 2*a*b*d_2*f1_2 + 4*b_2*c*d*f2_2 + 4*a*b*d_2*f2_2 + 4*a*b_3 + a*b*c_2 - a_2*c*d);
  		poly.c[1] = d_4*f2_4 + 2*b_2*d_2*f2_2 + b_4 + b_2*c_2 - a_2*d_2;
  		poly.c[0] = b_2*c*d - a*b*d_2;
  
  		return rootFinder.process(poly);
  	}