English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28326/40319
Visitors : 4083938      Online Users : 72
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41717

Title: The shortest overall distance of two piecewise rhumb-lines
Authors: Wei-Kuo Tseng
Contributors: 國立臺灣海洋大學:商船學系
Keywords: Great Circle
Date: 2014-08
Issue Date: 2017-03-22
Publisher: Natural Computation (ICNC)
Abstract: 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).
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41717
Appears in Collections:[商船學系] 演講及研討會

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback