//Debug("%u turning points", turns.size());
for (unsigned i = 1; i < turns.size(); ++i)
{
- if (tl > max) break;
- tu = std::min(turns[i],tu);
+ //if (tl > max) break;
+ tu = turns[i];
CubicSolveSegment(roots, a, b, c, d, tl, tu,delta);
tl = turns[i];
}
- if (tu < max)
- {
- tu = max;
- CubicSolveSegment(roots, a, b, c, d, tl, tu,delta);
- }
+ tu = max;
+ CubicSolveSegment(roots, a, b, c, d, tl, tu,delta);
return roots;
}