in fact the great work is David's, not mine - I made the original
attempt, which was buggy, and then supplied a fix, but David wrote a
new version which was justified mathematically and based on Hain's
paper, as you mention. So I'll have to pass the responsibility for
explaining it to David Bevan.
On 30/10/2011 08:25, Vivek Rathod wrote:
I was looking at the new spline flattening algorithm that you and
David worked on.
The speed up due to this is fantastic. Great work!
I could not understand the part of the code where you compare s_limit
according to Hain's paper
dmax = (s/L) * dnorm ; here s is not normalized. dmax is
the tolerance for flatness and dnorm is the normalized flatness of
so s_limit = (dmax / dnorm) * L ; by putting dnorm
= 0.75 we get the permissible height of the control point for the
curve not to be split.
so should we not be comparing s= abs(dy * dxi - dx * dyi)
with s_limit * L instead of s and s_limit
( because s is perpendicular distance of control point multiplied
by L) ?
Am I missing something very obvious?