Marlin cubic bezier accuracy !

[alexey.ushakov at jetbrains.com]

Hi Laurent,

Actually part of the work (separating curves into monotonic ones) I've
implemented in Java years ago, see ProcessQuad/ProcessCubic
https://github.com/openjdk/jdk/blob/master/src/java.desktop/share/classes/sun/java2d/loops/ProcessPath.java

I suppose applying some kind of Newton algorithm to the monotonic parts
should be no-brainer.

Best Regards,
Alexey
 
On Thu, 2024-10-17 at 11:33 -0700, Philip Race wrote:
> Hi Laurent,
> 
> I think there'd be problems with any of these.
> I can't see the JDK depending on Rust, and some optionally available 
> functionality would
> be very unusual.  And it'll be some time before we work out how the
> JDK 
> itself will use
> jextract etc for FFM access to non-JDK libraries. There's 3rd party 
> legal issues and build issues.
> 
> -phil.
> 
> On 10/12/24 2:27 AM, Laurent Bourgès wrote:
> > Hi,
> > 
> > I wonder if I could use good math native library like gsl if
> > present 
> > to use FFM in order to have high accuracy on polynom eval, solver
> > for 
> > quadratic & cubic polynoms.
> > 
> > I need an high accuracy (double double) solver for cubics & quads
> > to 
> > compute intersection line & cubic bezier.
> > See http://www.cemyuksel.com/research/polynomials/
> > 
> > Alternatively I could write a julia or rust code to implement my
> > needs 
> > and link it with openjdk.
> > 
> > See my paper work,
> > Good week-end,
> > Laurent
>