Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

More efficient root finding/bisection? #23

Open
mgeier opened this issue Mar 12, 2023 · 1 comment
Open

More efficient root finding/bisection? #23

mgeier opened this issue Mar 12, 2023 · 1 comment

Comments

@mgeier
Copy link
Member

mgeier commented Mar 12, 2023

Maybe using external crates like https://crates.io/crates/peroxide, https://crates.io/crates/bacon-sci, etc.?

But first, there should be benchmarks ...

@mgeier
Copy link
Member Author

mgeier commented Apr 2, 2024

This looks like an interesting blog post about arc length: https://raphlinus.github.io/curves/2018/12/28/bezier-arclength.html (follow-up: https://raphlinus.github.io/curves/graphics/2019/01/04/followups.html#arclength)

Maybe it gives some hints for implementation?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant