在点云中查找线 [英] Find Lines in a cloud of points

问题描述

我有一组积分.我知道这些点代表了我页面中的许多行.

I have an array of Points. I KNOW that these points represent many lines in my page.

如何找到它们?我需要找到点云之间的间距吗?

How can I find them? Do I need to find the spacing between clouds of points?

谢谢 乔纳森

推荐答案

也许霍夫变换您在找什么?还是线性回归?

Maybe the Hough Transform is what you are looking for? Or a linear regression?

事实证明，问题是要确定二维坐标列表中的线，我将以这种方式进行处理.

As it turns out the problem is to identify lines inside a list of 2d coordinates I would proceed this way.

线性回归只能用于对一组点进行最佳线性调整，而不能检测很多线.也许用hough粗略地得到线，检查很多点在这些线上是否对齐.看一看剩下的要点.他们必须属于一条线吗?

A linear regression can only be used for making the best linear adjustment for a set of points, not to detect many lines. Maybe use hough to get roughly the lines, check if many points align on these lines. Have a look at the points left aside. Do they have to belong to a line?

在我看来，通常使用蓄电池来确定线段是一个好的解决方案，但是如果您的观点遵循某些关系，请尝试使蓄电池适应于此以使其更合适.

Using an accumulator to determine the lines seems to me a good solution in general but if your points follow some relations, try to adapt the accumulator to it to make it fit better.

问题定义不是那么具体，很难确切说明如何进行.在我看来，使用累加器解决此类问题似乎是必须坚持的基础.

The problem definition is not so specific, it is difficult to tell exactly how to proceed. The use of an accumulator for such kind of problems seems a basis to me that must be kept.

至少问题是有趣的！

At least the problem is interesting!

这篇关于在点云中查找线的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！