Win8 Metro(C#)数字图像处理--2.74图像凸包计算

最新推荐文章于 2021-12-19 11:42:21 发布

转载最新推荐文章于 2021-12-19 11:42:21 发布 · 108 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lonelyxmas/p/8554740.html

文章标签：

#人工智能 #c# #php

本文介绍了一个使用C#实现的图像凸包计算方法。该方法通过一系列坐标判断来确定图像轮廓的凸包，并提供了详细的代码示例。适用于Win8 Metro应用中的图像处理场景。

Win8 Metro(C#)数字图像处理--2.74图像凸包计算

原文: Win8 Metro(C#)数字图像处理--2.74图像凸包计算

        /// <summary>
        /// Convex Hull compute.
        /// </summary>
        /// <param name="points">The source image points.</param>
        /// <param name="startPoints"></param>
        /// <param name="endPoints"></param>
        private static void ConvexhullCompute(ref Point[] srcPoints,ref List<Point>startPoints,  ref List<Point> endPoints)
        {
            Point start;
            Point end;
            double a = 0, b = 0;
            int signa = 0, signb = 0;
            int max = srcPoints.Length;
            double temp = 0.0;
            int t = 0;
            double tx = 0.0;
            for (int i = 0; i < max; i++)
            {
                start = srcPoints[i];
                for (int k = i + 1; k < max; k++)
                {
                    end = srcPoints[k];
                    if (start.X == end.X)
                    {
                        for (int j = 0; j < max; j++)
                        {
                            if ((!(signa > 0 && signb > 0)) && (j != i && j != k))
                            {
                                t = srcPoints[j].X;
                                if (t > start.X)
                                    signa++;
                                if (t < start.X)
                                    signb++;
                            }
                        }
                    }
                    else
                    {
                        a = (double)(end.Y - start.Y) / (double)(end.X - start.X);
                        b = (double)start.Y - (double)start.X * a;
                        for (int j = 0; j < max; j++)
                        {
                            if ((!(signa > 0 && signb > 0)) && (j != i && j != k))
                            {
                                temp = a * (double)srcPoints[j].X + b;
                                tx = (double)srcPoints[j].Y;
                                if (temp > tx)
                                    signa++;
                                if (temp < tx)
                                    signb++;
                            }
                        }
                    }
                    if (signa * signb == 0)
                    {
                        startPoints.Add(start);
                        endPoints.Add(end);
                    }
                    signb = 0;
                    signa = 0;
                }
            }
        }