将最大凸包拟合到一组点的内部 [英] Fit maximum convex hull to interior of a set of points

问题描述

我想找到适合于一组点内部的最大凸包.我有一组大致为圆形的点，我想拟合的圆之外有许多离群点.想象一个带有太阳耀斑"的圆圈...我想适合这个圆圈，而完全不理会耀斑.我尝试了各种适合和剔除策略，但是效果不佳.

I'd like to find the largest convex hull which fits in the interior of a set of points. I have a set of points which are roughly circular, with a large number of outlier points outside of the circle I'd like to fit. Imagine a circle with "solar flares"... I want to fit the circle and completely ignore the flares. I've tried various fit and culling strategies, but they aren't working well.

我已经搜索了很多，却没有找到解决方案.预先感谢.

I've searched quite a bit and not found a solution. Thanks in advance.

推荐答案

您需要的概念可能是alpha形状.凸包是alpha形状的子集，用于alpha的极值.Alpha形状使一组比凸包更近的点适合Alpha值.

The notion you need may be alpha shapes. The convex hull is a sub-set of the alpha-shape for an extreme value for alpha. The alpha shape is fitting a set of point closer than the convex hull with some values for alpha.

理论是由Edelbrunner开发的.这是一个好的开始: http://www.mpi-inf.mpg.de/~jgiesen/tch/sem06/Celikik.pdf

Theory has been developed by Edelbrunner. This is a good start: http://www.mpi-inf.mpg.de/~jgiesen/tch/sem06/Celikik.pdf

对于计算，您必须:计算delaunay三角剖分和/或voronoi图，然后选择观察一种情况的点.

For computation, you must: compute delaunay triangulation and/or voronoi diagram, then select points that observe one condition.

示例alpha形状:

这实际上是一个凹壳，可能会忽略异常值.

This is in fact a concave hull, and it may disregard outliers.

这篇关于将最大凸包拟合到一组点的内部的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！