寻找大地测量Python软件 [英] Looking For Geodetic Python Software

问题描述

有没有人知道免费提供的Python模块可以执行以下任务：


1）给定两个位置的纬度/经度，计算它们之间的距离

。 "距离"在这种情况下，可以是直线

飞行距离，也可以是地球曲率的实际地上距离。



2）给定n个纬度/经度坐标，计算

geocenter。也就是说，返回

最多中央位置的纬度/经度。所有n个初始坐标。


3）给定n纬度/经度坐标，计算一个Kruskal型跨越

树。

4）给定n纬度/经度坐标，计算到达每个节点一次的最佳（最短或最长）
访问路径。更好的是

是具有可插拔的东西。启发式引擎，所以我们可以尝试不同的方法，如贪婪，最短路径，爬山，以及

等等。如果还可以模拟不同的b
路由方案（蒙特卡罗？）会更好。


实际上，我正在寻找一些东西配对传统的图遍历

启发式算法与运算研究工具在大地测量工作上的b $ b坐标系。这是* waaaaay *在我的专业领域之外所以

我希望有人为我这样的假人带来痛苦;）


TIA ，

-

------------------------------- ---------------------------------------------

Tim Daneliuk tu****@tundraware.com

PGP Key： http://www.tundraware.com/PGP/

Is anyone aware of freely available Python modules that can do any of
the following tasks:

1) Given the latitude/longitude of two locations, compute the distance
between them. "Distance" in this case would be either the straight-line
flying distance, or the actual over-ground distance that accounts for
the earth''s curvature.

2) Given n latitude/longitude coordinates, compute the
"geocenter". That is, return the lat/long of the location that
is most "central" to all n initial coordinates.

3) Given n lat/long coordinates, compute a Kruskal-type spanning
tree.

4) Given n lat/long coordinates, compute an optimal (shortest or longest)
visitation path that reaches each node exactly once. Better still would
be something that had "pluggable" heuristic engines so we could try
different approaches like greedy, shortest-path, hill climbing, and
so forth. It would be even nicer if one could also simulate different
routing schemes (Monte Carlo?).

In effect, I''m looking for something that mates traditional graph traversal
heuristics with operations research tools working on a geodetic
coordinate system. This is *waaaaay* outside my field of expertise so
I''m hoping someone has taken the pain of it for dummies like me ;)

TIA,
--
----------------------------------------------------------------------------
Tim Daneliuk tu****@tundraware.com
PGP Key: http://www.tundraware.com/PGP/

推荐答案

Tim Daneliuk< tu **** @ tundraware.com>写道：

Tim Daneliuk <tu****@tundraware.com> wrote:

有没有人知道免费提供的Python模块可以完成以下任务：

1）给定纬度/经度在两个位置，计算它们之间的距离。 "距离"在这种情况下，可能是直线的飞行距离，也可能是地球曲率的实际地面距离。

Is anyone aware of freely available Python modules that can do any of
the following tasks:

1) Given the latitude/longitude of two locations, compute the distance
between them. "Distance" in this case would be either the straight-line
flying distance, or the actual over-ground distance that accounts for
the earth''s curvature.

您的飞机是飞越地球表面还是飞越地面？

-

问候，

凯西

Do your planes fly over the earth''s surface or through the ground?
--
Regards,
Casey

Tim Daneliuk< tu **** @ tundraware.com>写道：

Tim Daneliuk <tu****@tundraware.com> writes:

1）给定两个位置的纬度/经度，计算它们之间的距离。 "距离"在这种情况下，可以是直线的飞行距离，也可以是考虑地球曲率的实际地面距离。


对于球形地球，这很容易，只需将2个位置视为

向量，其原点位于地球的中心，其长度为

地球的半径。将lat-long转换为3-D矩形

坐标，现在向量之间的角度为
arccos（x dotproduct y）。那么地面距离就是R * theta

，其中theta是角度。

2）给定n个纬度/经度坐标，计算
>地心" ;.也就是说，返回
最中心位置的纬度/经度。到所有n个初始坐标。


不确定这是什么。

3）给定n纬度/经度坐标，计算一个Kruskal型跨越树。


不确定这是什么。

4）给定n纬度/经度坐标，计算最佳（最短或最长）的访问路径恰好到达每个节点一次。更好的还是会有可插拔的东西。启发式引擎，所以我们可以尝试不同的方法，如贪婪，最短路径，爬山，以及
等等。如果还可以模拟不同的路由方案（蒙特卡罗？）会更好。

1) Given the latitude/longitude of two locations, compute the distance
between them. "Distance" in this case would be either the straight-line
flying distance, or the actual over-ground distance that accounts for
the earth''s curvature.
For spherical earth, this is easy, just treat the 2 locations as
vectors whose origin is at the center of the earth and whose length is
the radius of the earth. Convert the lat-long to 3-D rectangular
coordinates and now the angle between the vectors is
arccos(x dotproduct y). The over-ground distance is then just R*theta
where theta is the angle.
2) Given n latitude/longitude coordinates, compute the
"geocenter". That is, return the lat/long of the location that
is most "central" to all n initial coordinates.
Not sure what this is.
3) Given n lat/long coordinates, compute a Kruskal-type spanning
tree.
Not sure what this is.
4) Given n lat/long coordinates, compute an optimal (shortest or longest)
visitation path that reaches each node exactly once. Better still would
be something that had "pluggable" heuristic engines so we could try
different approaches like greedy, shortest-path, hill climbing, and
so forth. It would be even nicer if one could also simulate different
routing schemes (Monte Carlo?).

这当然是NP难度但有各种标准TSP

启发式（用于具有2-d欧几里德距离的地图的那些可能会因为球形问题而不能用于b $ b）。 组合优化

由Steiglitz和Papadimitriou撰写，是这篇文章的标准文本。

This is certainly NP-hard but there are various standard TSP
heuristics (the ones intended for maps with 2-d Euclidean distance may
not work on spherical problems though). "Combinatorial Optimization"
by Steiglitz and Papadimitriou is the standard text on this stuff.

Casey Hawthorne写道：

Casey Hawthorne wrote:

Tim Daneliuk< tu **** @ tundraware.com>写道：

Tim Daneliuk <tu****@tundraware.com> wrote:

是否有人知道可以免费使用的Python模块可以执行以下任务：

1）给定两个位置的纬度/经度，计算它们之间的距离。 "距离"在这种情况下，可以是直线的飞行距离，也可以是地球曲率的实际地面距离。

Is anyone aware of freely available Python modules that can do any of
the following tasks:

1) Given the latitude/longitude of two locations, compute the distance
between them. "Distance" in this case would be either the straight-line
flying distance, or the actual over-ground distance that accounts for
the earth''s curvature.

你的飞机是飞过地球表面还是飞过地面？

-
问候，
凯西

Do your planes fly over the earth''s surface or through the ground?
--
Regards,
Casey

为什么你认为这与飞机有什么关系？


-

------------- -------------------------------------------------- -------------

Tim Daneliuk tu****@tundraware.com

PGP密钥： http：// www。 tundraware.com/PGP/

这篇关于寻找大地测量Python软件的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！