两个纬度/经度点之间的C＃计算N多沿大圆路径点 [英] C# Calculate n Number of Points along a Great Circle path between Two Latitude/Longitude points

问题描述

我策划，我对纬度和经度值到谷歌地图（API的第3版）的机场之间的飞行路线。

I am plotting flight paths between Airports that I have Latitude and Longitude values for onto a Google Map (v3 of the API).

然而不同于V2，V3确实似乎没有一个选项，把一个折线在地图上两点之间并使其显示为大圆航迹。

However unlike v2, v3 does not seem to have an option to put a Polyline on the map between two points and have it display as the great-circle flightpath.

所以，我在想什么，是有可能计算出一个数字沿着两个纬度/经度点之间的大圆路径点。

So what I was thinking, was that it might be possible to calculate a number of points along a great-circle path between two Latitude/Longitude points.

我最不善于用数学和我完全不明白或如何理解大圆计算的工作。
有谁知道一个C＃库或代码SNIPPIT，可以采取两种纬度和经度点，并计算了一些沿它们之间的大圆路径点的？

I'm terrible with maths and I can hardly understand or comprehend how the great-circle calculations work. Does anyone know of a C# library or code snippit that can take two latitude and longitude points and calculate a number of points along the great-circle path between them ?

推荐答案

看看的迈克Gavaghan的C＃库大地测量学。

这篇关于两个纬度/经度点之间的C＃计算N多沿大圆路径点的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！