Minimax polynomial ECEF to geodetic coordinate transformation approximations

Minimax polynomial ECEF to geodetic coordinate transformation approximations are presented, including often preferable n-vector versions and pseudo-code implementations. The approximations provide high accuracy-to-computational-cost tunability and an unprecedented low latency down to an accuracy of $\sim10^{-5}$m, which is demonstrated in an extensive benchmark. This sets a new standard for coarse and fast ECEF to geodetic coordinate transformations and opens up a new realm of further improvement opportunities and extensions to other geodetic quantities.