Summary: | 碩士 === 國立成功大學 === 測量及空間資訊學系碩博士班 === 96 === With the growing popularity of surveying by GPS, the demand of coordinate transformation increases gradually. The transformation from geocentric to geodetic coordinates, known as coordinate conversion, is often needed for some applications in geodetic work. In order to deal with the coordinate conversion problem of a plenty of points, an efficient and accurate algorithm is necessary. The current available algorithms to solve the conversion problem are either the iterative methods by a linearization procedure, or the closed methods by an algebraic equation of forth degree. In this study, five algorithms proposed from 1970 to 2000 for the coordinate conversion are implemented and compared for numerical efficiency. According to the analysis of our numerical results, we may conclude that accuracy of results and iterative times of different algorithms vary with geodetic heights and latitudes.
In this paper, we also introduce a new parametric angle as an initial value into the famous Bowring formula. A more accurate result can be achieved by this new parametric angle than by the original parametric angle proposed by Bowring.
|