> + two coalition equation solution: > + det = i.y * o.x - i.x * o.y , det != 0 > + shift.x = strength * ( i.x - o.x ) / det > + shift.y = strength * ( i.y - o.y ) / det
So your algorithm is exactly the same as the one implemented currently. The tricky part is how you deal with very short collapsing segments, the segments of zero length, and your threshold on the determinant. Can you please elaborate on that and explain why your algorithm is superior? _______________________________________________ Freetype-devel mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/freetype-devel
