Given the point P on the “canonical” ellipse defined by the axes a, b , and the length of the arc s , as I can find the point Q , also on the ellipse, that is, s clockwise along the elliptic curve from P - such that if I started with P and "walked" along the elliptic curve to a distance s , would I have reached Q - programmatically and without breaking the computing bank?
I heard that this can be calculated using some kind of elliptic integration, but I need to make it a bunch and fast. What I'm looking for is an easy to use, computationally inexpensive and fairly accurate approximation method. Or at least a method that is one or two of these things. I will implement this in python.
Edit:, as an alternative, I may need to create a lookup table for position values around ellipses (I may need only the 10th of dissimilar ellipses). How do I do this and what method can I use to populate it?
source share