The shortest overall distance of two piecewise rhumb-lines

Wei-Kuo Tseng
{"title":"The shortest overall distance of two piecewise rhumb-lines","authors":"Wei-Kuo Tseng","doi":"10.1109/ICNC.2014.6976004","DOIUrl":null,"url":null,"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).","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 10th International Conference on Natural Computation (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2014.6976004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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).
两条分段横线的最短总距离
本文提出了一种简单、逻辑的分段等值线算法。利用横横线航行公式和数学优化可以计算分段横横线的最小总距离。通过构造分段的伦理线航行,读者可以快速理解和掌握方程的含义。在数值试验剖面中,选取了一个拐点的具体实例,其结果表明,总距离最短的拐点不是大圆与沿大圆的初始航向等于中纬度航向的基准线的交点。这项工作提供的结论是反对彼得罗维奇(2014)提供的声明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信