On 7/2/18, 6:32 AM, "David Kastrup" <d...@gnu.org> wrote:
I'll take a thorough look at this code. Looks like it could benefit
from a more graphic approach to intersections than converting everything
into zero-based polynomials and then doing root finding.
I probably have a link to some good, robust Bezier intersection finding
algorithms if you are interested.
Carl
_______________________________________________
bug-lilypond mailing list
bug-lilypond@gnu.org
https://lists.gnu.org/mailman/listinfo/bug-lilypond
