Replies: 1 comment
-
I’m not sure that such functionality belongs in the library. I would though HIGHLY suggest the algorithm in this paper. Its performance is on the order of O(n+m), where n and m is the total number of points for your two curves. It really has an impact when your curves have many points. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hello,
I am building an algo where I have 2 moving averages (curves) and I would like to get all the intersection points. I have an existing code to do this, but the performance is not good.
I am very interested in this library, and it is looking very good and promising. I would like to know if someone could help me with some docs or how I could get this done using this amazing library! Thank you so much!
Beta Was this translation helpful? Give feedback.
All reactions