我点（2D：由x和y的定义）的集合S，我想求P，最小的（意思是：用最小点数）多边形封闭组的所有点，P是的S有序的子集。

I have a set S of points (2D : defined by x and y) and I want to find P, the smallest (meaning : with the smallest number of points) polygon enclosing all the points of the set, P being an ordered subset of S.

是否有任何已知的算法来计算呢？ （我在这个领域缺少文化是惊人的...）

Are there any known algorithms to compute this? (my lack of culture in this domain is astonishing...)

感谢您的帮助

推荐答案

有很多算法针对此问题。它被称为最小边框。你会发现解决方案过于搜索凸包，特别的