二维点云的轮廓
我有二维分散的点云。我的问题是我想获取边界点以获得点云的轮廓。
我知道这个“行进方块”，但是这个算法通常用于二维像素。 任何人都知道如何从二维点云或“行进广场”算法的细节中获取轮廓？此外，凸包在我的情况下不起作用。
提前致谢。
I have scattered point clouds in 2d. My problem is I would like to get the boundary's point to get the contour of the point clouds.
I know about this 'marching square' however this algorithm usually used for pixel in 2d.
Any one have idea how to get the contour from 2d point clouds or details of 'Marching square' algorithm? In addition, convex hull does not work in my case.
Thanks in advance.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
我认为 2D“Alpha 形状”算法将是您的正确选择。
http://www.cgal.org/Manual/latest/doc_html /cgal_manual/Alpha_shapes_2/Chapter_main.html
Alpha 形状可以被视为“凸包”算法的概括，该算法允许生成更一般的形状。
通过使用 alpha 形状，您将可以通过更改 alpha 参数值来控制生成的形状捕获的细节级别。
您可以在这里尝试 Java 小程序：http://cgm。 cs.mcgill.ca/~godfried/teaching/projects97/belair/alpha.html
以更好地了解该算法的作用。
I think the 2D "Alpha shapes" algorithm would the right choice for you.
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Alpha_shapes_2/Chapter_main.html
Alpha shapes can be considered as a generalization for the "convex Hull" algorithm that allows for generation of more general shapes.
By using alpha shapes you will be having control over the level of details to be captured by the resultant shape by changing the alpha parameter value.
You can try the java applet here : http://cgm.cs.mcgill.ca/~godfried/teaching/projects97/belair/alpha.html
to have better understanding about does this algorithm do.
我建议使用 Delaunay triangulation 作为基本算法，然后删除所有太大的三角形（从而将云分成几组），然后删除多个三角形使用的所有边。
I would suggest using the Delaunay triangulation as a base algorithm, then removing all triangles which are too big (thus splitting the clouds to groups), then removing all edges used by more than one triangle.