对平面上的点集，寻找它的最小面积包围矩形，最小周长包围矩形，以及最大距离点对。算法采用了游标卡尺的思想，在找到凸包后时间复杂度为线性。-for finding the minimum area encasing rectangle and the maximum distance pair. The complexity of this algorithm is O(n),so it s very fast.

随机生成一些点，然后利用这些点生成凸包。-Randomly generated at some point, and then use these points to generate the convex hull.

运用角度来生成任意二维点集的凸包，并用OpenGL显示-the generation of the hull in 2D

通过OPENCV库中相关算法对图像降噪、求边缘、直线遍历并获得直线角度、获得图像中目标的凸包等-Use OPENCV Lib to filer image, get the edges of image and so on.