A source code for effective use of convex hull. Calibrate it for your hand.

finds upper convex hull of sorted points(32). on CUDA-finds upper convex hull of sorted points(32). on CUDA

平面点集 凸包 找最小覆盖矩形面积 平面点集 凸包 找最小覆盖矩形面积-Planar point set to find the smallest rectangle that covers the convex hull of a plane convex hull area to find the smallest rectangular area covering the convex hull of planar point sets to find the smallest cover

凸包算法，包括暴力穷举法，递归算法等，最后使用opengl将所有的凸包顶点绘制-Convex hull algorithms, including violence exhaustive method, recursive algorithm, and finally use opengl all the convex hull VertexPaint