Minimax polynomial ECEF to geodetic coordinate transformation approximations

TL;DR

This paper introduces minimax polynomial approximations for ECEF to geodetic coordinate transformations, achieving high accuracy with low computational cost and minimal latency, setting a new standard for fast geodetic conversions.

Contribution

It presents a novel minimax polynomial approach for ECEF to geodetic transformations, including n-vector versions and pseudo-code, with unprecedented low latency and high accuracy.

Findings

Achieves accuracy of ~10^{-5} meters

Demonstrates low latency in extensive benchmarks

Sets new standard for fast geodetic transformations

Abstract

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.