DocumentCode
176011
Title
The shortest overall distance of two piecewise rhumb-lines
Author
Wei-Kuo Tseng
Author_Institution
Dept. of Merchant Marine, Taiwan Ocean Univ., Keelung, Taiwan
fYear
2014
fDate
19-21 Aug. 2014
Firstpage
1153
Lastpage
1157
Abstract
This paper presents the simple and logical algorithms of piecewise rhumb-lines. Using the formulae of rhumb-line sailing and mathematical optimization may calculate the minimum overall distance for piecewise rhumb-lines. By constructing the piecewise rhumb-lines sailing, readers can quickly comprehend and grasp the meanings of equations. In the numerical test section, one specific example of one turning point is selected here which its results points out that the turning point with shortest overall distance is not the intersection of the great circle and the rhumb-line with initial course equal to the course of middle latitude along the great circle. The conclusion provided by this work is against the statement provided by Petrović (2014).
Keywords
computational geometry; numerical analysis; optimisation; logical algorithms; mathematical optimization; numerical test section; piecewise rhumb-line sailing; shortest overall distance; Earth; Equations; Iterative methods; Joining processes; Mathematical model; Navigation; Turning; Great Circle; Loxodrome; Rhumb-line; Vertex;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2014 10th International Conference on
Conference_Location
Xiamen
Print_ISBN
978-1-4799-5150-5
Type
conf
DOI
10.1109/ICNC.2014.6976004
Filename
6976004
Link To Document