我有嘈杂的X，Y点的无序列表。他们这样做，但是，形成贯通世界的路径。我想一个算法使用线段来绘制这些数据的近似。

I have an unsorted list of noisy X, Y points. They do, however, form a path through the world. I would like an algorithm to draw an approximation of this data using line segments.

这是类似于你将如何使用行水用快速的算法来接线性数据的近似。我的问题是只更难，因为该路径弯曲及世界各地的风。

This is similar to how you would use a line -fitting algorithm to pick an approximation of linear data. My problem is only harder because the path bends and winds around the world.

有谁知道的任何标准/强健/易COM prehend算法来做到这一点？

Does anyone know of any standard / robust / easy to comprehend algorithms to accomplish this?

Q＆放大器; A

你是什么意思吵？如果我有一个理想的实现路径，然后我点的集合将被从理想路线采样与高斯噪声加入到X和Y的元素。我不知道的平均值或噪声的标准偏差。我也许能猜到标准偏差...

What do you mean by noisy? If I had an ideal realization of the path, then my set of points would be sampled from that ideal path with gaussian noise added to the X and Y elements. I do not know the mean or standard deviation of that noise. I may be able to guess at the std dev...

执行点位于附近，但不上，逼近你寻求某种理想，但复杂的路径？是

你有关于他塑造路径的任何先验信息？任何其他方式获取这些信息？遗憾的是没有。

推荐答案

通过一个未排序列表中，你不会真正知道它指向每个段包括，所以我想你可以随便去的最近点。

With an unsorted list, you won't really know which points to include in each segment, so I guess you could just go with the closest point.

的一种方法可以是选择一个开始点处随机的，并挑选的最近点在每个步骤中的下一个点。前两个点加入到集合S。

One way could be to pick a start point at random, and pick the closest point as the next point in each step. Add the first two points to a set S.

适合一行S中的点，直到RMS超过一定值时，则明确S和开始新的一行。

Fit a line to the points in S until the RMS exceeds some value, then clear S and start a new line.

的连续的行的交叉点会是最终点的线段的

The intersection of consecutive lines would be the end-points of the segments.