Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T03:04:40.014Z Has data issue: false hasContentIssue false

New Algorithm for Great Elliptic Sailing (GES)

Published online by Cambridge University Press:  15 June 2009

Athanasios Pallikaris*
Affiliation:
(Hellenic Naval Academy)
George Latsas
Affiliation:
(National and Kapodistrian University of Athens)
Rights & Permissions [Opens in a new window]

Abstract

An analytical method and algorithm for great elliptic sailing (GES) calculations is presented. The method solves the complete GES problem calculating not only the great elliptic arc distance, but also other elements of the sailing such as the geodetic coordinates of intermediate points along the great elliptic arc. The proposed formulas provide extremely high accuracies and are straightforward to be exploited immediately in the development of navigational software, without the requirement to use advanced numerical methods. Their validity and effectiveness have been verified with numerical tests and comparisons to extremely accurate geodetic methods for the direct and inverse geodetic problem.

Information

Type
Research Article
Copyright
Copyright © The Royal Institute of Navigation 2009
Figure 0

Figure 1. Great ellipse and great elliptic arc.

Figure 1

Figure 2. The length of the arc of the meridian.

Figure 2

Figure 3. The geodetic great elliptic angle ϕge and the geocentric great elliptic angle θge.

Figure 3

Figure 4. The Haiwara Dataset superimposed over the Pacific Ocean.

Figure 4

Figure 5. Average discrepancies between the evaluated method and the precise length of the geodesic distance computed by Vincenty's algorithm.

Figure 5

Table 1. Geodesic and great elliptic arc numerical tests using the Haiwara eight testlines.

Figure 6

Table 2. Calculating route from Sydney to Valparaiso.