，我有许多记录由GPS，它更正式地可以被描述为若干行的字符串的轨道。

I have a number of tracks recorded by a GPS, which more formally can be described as a number of line strings.

现在，一些记录磁道可能是因为在GPS系统inaccurasies的同一路线的记录，但是，事实上，在录音被在不同的场合，他们可能已被记录在不同的速度行进制成，它们将不匹配完美，但仍期待在地图上查看时，足够近由人来确定，它实际上已被记录在相同的路由。

Now, some of the recorded tracks might be recordings of the same route, but because of inaccurasies in the GPS system, the fact that the recordings were made on separate occasions and that they might have been recorded travelling at different speeds, they won't match up perfectly, but still look close enough when viewed on a map by a human to determine that it's actually the same route that has been recorded.

我想找到一个算法，计算两个线串之间的相似性。我已经提出了一些土生土长的方法来做到这一点，但想知道这是否是一个问题，这就是已经有了很好的算法来解决这个问题。

I want to find an algorithm that calculates the similarity between two line strings. I have come up with some home grown methods to do this, but would like to know if this is a problem that's already has good algorithms to solve it.

您将如何计算的相似性，因为类似的手段重新presents在地图上相同的路径？

How would you calculate the similarity, given that similar means represents the same path on a map?

编辑：对于那些不能确定什么，我说什么，请看看这个链接，一个什么样的线串是一个定义：http://msdn.microsoft.com/en-us/library/bb895372.aspx - 我的不是的询问字符串

For those unsure of what I'm talking about, please look at this link for a definition of what a line string is: http://msdn.microsoft.com/en-us/library/bb895372.aspx - I'm not asking about character strings.

推荐答案

计算Fréchet可距离的每对磁迹的。的距离可以用来衡量曲目的相似性。

Compute the Fréchet distance on each pair of tracks. The distance can be used to gauge the similarity of your tracks.

数学警告：的Fréchet可为先驱度量空间领域是有关您的问题。

Math alert: Fréchet was a pioneer in the field of metric space which is relevant to your problem.