C#凸包算法

一、描述

凸包：给定二维平面上的点集，凸包就是将最外层的点连接起来构成的凸多边形，它能包含点集中所有的点。结果如下图所示。

二、算法

参数传入点集即可。

private List<Point> calcConvexHull(List<Point> list)
{
    List<Point> resPoint = new List<Point>();
	//查找最小坐标点
    int minIndex = 0;
    for (int i = 1; i < list.Count; i++)
    {
        if (list[i].Y < list[minIndex].Y)
        {
            minIndex = i;
        }
    }
    Point minPoint = list[minIndex];
    resPoint.Add(list[minIndex]);
    list.RemoveAt(minIndex);
	//坐标点排序
    list.Sort(
        delegate(Point p1, Point p2)
        {
            vector baseVec;
            baseVec.x = 1;
            baseVec.y = 0;

            vector p1Vec;
            p1Vec.x = p1.X - minPoint.X;
            p1Vec.y = p1.Y - minPoint.Y;

            vector p2Vec;
            p2Vec.x = p2.X - minPoint.X;
            p2Vec.y = p2.Y - minPoint.Y;

            double up1 = p1Vec.x * baseVec.x;
            double down1 = Math.Sqrt(p1Vec.x * p1Vec.x + p1Vec.y * p1Vec.y);

            double up2 = p2Vec.x * baseVec.x;
            double down2 = Math.Sqrt(p2Vec.x * p2Vec.x + p2Vec.y * p2Vec.y);


            double cosP1 = up1 / down1;
            double cosP2 = up2 / down2;

            if (cosP1 > cosP2)
            {
                return -1;
            }
            else
            {
                return 1;
            }
        }
        );
    resPoint.Add(list[0]);
    resPoint.Add(list[1]);
    for (int i = 2; i < list.Count; i++)
    {
        Point basePt = resPoint[resPoint.Count - 2];
        vector v1;
        v1.x = list[i - 1].X - basePt.X;
        v1.y = list[i - 1].Y - basePt.Y;

        vector v2;
        v2.x = list[i].X - basePt.X;
        v2.y = list[i].Y - basePt.Y;

        if (v1.x * v2.y - v1.y * v2.x < 0)
        {
            resPoint.RemoveAt(resPoint.Count - 1);
            while (true)
            {
                Point basePt2 = resPoint[resPoint.Count - 2];
                vector v12;
                v12.x = resPoint[resPoint.Count - 1].X - basePt2.X;
                v12.y = resPoint[resPoint.Count - 1].Y - basePt2.Y;
                vector v22;
                v22.x = list[i].X - basePt2.X;
                v22.y = list[i].Y - basePt2.Y;
                if (v12.x * v22.y - v12.y * v22.x < 0)
                {
                    resPoint.RemoveAt(resPoint.Count - 1);
                }
                else
                {
                    break;
                }
            }
            resPoint.Add(list[i]);
        }
        else
        {
            resPoint.Add(list[i]);
        }
    }
    return resPoint;
}