点在多边形内算法

        /// <summary>
        /// 射线相交算法1
        /// </summary>
        /// <param name="poly"></param>
        /// <param name="aPoint"></param>
        /// <returns></returns>
        public static bool IsInPolygon(List<RgPoint> poly, RgPoint aPoint)
        {
            bool flag = false;
            int count = poly.Count;
            if (count < 3)
            {
                return false;
            }
            double x = poly[count - 1].X;
            double y = poly[count - 1].Y;
            for (int i = 0; i < count; i++)
            {
                double num5;
                double num6;
                double num7;
                double num8;
                if (poly[i].X > x)
                {
                    num5 = x;
                    num7 = poly[i].X;
                    num6 = y;