Carl Sorensen <[email protected]> writes: > On 7/2/18, 6:32 AM, "David Kastrup" <[email protected]> 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.
Chapter 9 and 11 of something? -- David Kastrup _______________________________________________ bug-lilypond mailing list [email protected] https://lists.gnu.org/mailman/listinfo/bug-lilypond
