It may be, especially when it comes to unnecessary cache. But I think `atan` is almost a brute force. Lookup is nothing comparing to that.
Sin/cos must be borders of sqrt(x²+y²). It is also cached indeed.
> Sin/cos must be borders of sqrt(x²+y²). It is also cached indeed
This doesn't make a ton of sense.
What do you mean brute force?
We can compute these things using iteration or polynomial approximations (sufficient for 64 bit).