#1765 Fixed solvePoly for polynomials having coeffs[n] != 1
This commit is contained in:
parent
5ce2997c84
commit
dcadc4f8fb
@ -2487,7 +2487,7 @@ double cv::solvePoly( InputArray _coeffs0, OutputArray _roots0, int maxIters )
|
|||||||
for( i = 0; i < n; i++ )
|
for( i = 0; i < n; i++ )
|
||||||
{
|
{
|
||||||
p = roots[i];
|
p = roots[i];
|
||||||
C num = coeffs[n], denom = 1;
|
C num = coeffs[n], denom = coeffs[n];
|
||||||
for( j = 0; j < n; j++ )
|
for( j = 0; j < n; j++ )
|
||||||
{
|
{
|
||||||
num = num*p + coeffs[n-j-1];
|
num = num*p + coeffs[n-j-1];
|
||||||
|
Loading…
x
Reference in New Issue
Block a user