devbox
我家自动化
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

C#矩阵XY排序_c# 如何将一组点先按y值排列,再按x值排列

作者：我家自动化 | 2024-03-24 23:42:27

赞

踩

c# 如何将一组点先按y值排列,再按x值排列

矩阵XY快速排序

  1. using MyVision.Script.Method;
  2.  
  3. public class MyScript : ScriptMethods
  4. {
  5.     //
  6.     struct MOTIONPOSXY_S
  7.     {
  8.         public double Pos_x;
  9.         public double Pos_y;
  10.     };
  11.  
  12.     //脚本执行该方法
  13.     public bool Process()
  14.     {//@
  15.         try
  16.         {
  17.             //脚本代码写在下方 
  18.             List<double> PointX = GetDoubleList("斑点分析.X");
  19.             List<double> PointY = GetDoubleList("斑点分析.Y");
  20.             List<MOTIONPOSXY_S> PointList = new List<MOTIONPOSXY_S>();
  21.             for (int i = 0; i < PointX.Count(); ++i)
  22.             {
  23.                 MOTIONPOSXY_S tmp;
  24.                 tmp.Pos_x = PointX[i];
  25.                 tmp.Pos_y = PointY[i];
  26.                 PointList.Add(tmp);
  27.             }
  28.  
  29.             //
  30.             QuickSort(ref PointList, 0, PointX.Count() - 1);
  31.             for (int i = 0; i < PointX.Count(); ++i)
  32.             {
  33.                 PointX[i] = PointList[i].Pos_x;
  34.                 PointY[i] = PointList[i].Pos_y;
  35.                 //LogWarn("" + i + ":" + PointList[i].Pos_x + " " + PointList[i].Pos_y+ "", "");
  36.             }
  37.  
  38.             //
  39.             List<double> MPointX = new List<double>();
  40.             List<double> MPointY = new List<double>();
  41.             for (int i = 0; i < PointX.Count(); ++i)
  42.             {
  43.                 MPointX.Add(PointList[i].Pos_x);
  44.                 MPointY.Add(PointList[i].Pos_y);
  45.             }
  46.  
  47.             //
  48.             SetDoubleList("数组定义.PointX", MPointX);
  49.             SetDoubleList("数组定义.PointY", MPointY);
  50.  
  51.             //
  52.             return true;
  53.         }
  54.         catch (Exception ex)
  55.         {
  56.             LogError(GetLogPre() + ex.ToString());
  57.             return false;
  58.         }
  59.     }
  60.  
  61.     int Partition(ref List<MOTIONPOSXY_S> list, int low, int high)
  62.     {
  63.         MOTIONPOSXY_S pbase = list[low];
  64.         while (low < high)
  65.         {
  66.             while (low < high && CompareMotion_PosXy(pbase, list[high]))
  67.             {
  68.                 --high;
  69.             }
  70.             if (low < high)
  71.             {
  72.                 list[low] = list[high];
  73.             }
  74.             while (low < high && CompareMotion_PosXy(list[low], pbase))
  75.             {
  76.                 ++low;
  77.             }
  78.             if (low < high)
  79.             {
  80.                 list[high] = list[low];
  81.             }
  82.         }
  83.         list[low] = pbase;
  84.         return low;
  85.     }
  86.  
  87.     void QuickSort(ref List<MOTIONPOSXY_S> list, int low, int high)
  88.     {
  89.         if (low < high)
  90.         {
  91.             int pbase = Partition(ref list, low, high);
  92.             QuickSort(ref list, low, pbase - 1);
  93.             QuickSort(ref list, pbase + 1, high);
  94.         }
  95.     }
  96.  
  97.     //两个坐标比较大小const Test &v1, const Test &v2
  98.     bool CompareMotion_PosXy(MOTIONPOSXY_S p1, MOTIONPOSXY_S p2)
  99.     {
  100.         double difference = p1.Pos_y - p2.Pos_y;
  101.         difference = (difference >= 0 ? difference : (-difference));
  102.         if (p1.Pos_y < p2.Pos_y)
  103.         {
  104.             if (difference < 100) return (p1.Pos_x < p2.Pos_x);
  105.             else return true;
  106.         }
  107.         else if (p1.Pos_y == p2.Pos_y)
  108.         {
  109.             return (p1.Pos_x < p2.Pos_x);
  110.         }
  111.         else
  112.         {
  113.             if (difference < 100) return (p1.Pos_x < p2.Pos_x);
  114.             else return false;
  115.         }
  116.     }
  117. }

九点标定从中间往外排序

  1. using MyVision.Script.Method;
  2.  
  3. public class MyScript : ScriptMethods
  4. {
  5.     //
  6.     struct MOTIONPOSXY_S
  7.     {
  8.         public double Pos_x;
  9.         public double Pos_y;
  10.         public double Pos_r;
  11.     };
  12.  
  13.     //脚本执行该方法
  14.     public bool Process()
  15.     {//@
  16.         try
  17.         {
  18.             //脚本代码写在下方 
  19.             List<double> PointX = GetDoubleList("斑点分析.X");
  20.             List<double> PointY = GetDoubleList("斑点分析.Y");
  21.             List<double> PointR = GetDoubleList("斑点分析.最大内直径");
  22.             List<MOTIONPOSXY_S> PointList = new List<MOTIONPOSXY_S>();
  23.             for (int i = 0; i < PointX.Count(); ++i)
  24.             {
  25.                 MOTIONPOSXY_S tmp;
  26.                 tmp.Pos_x = PointX[i];
  27.                 tmp.Pos_y = PointY[i];
  28.                 tmp.Pos_r = PointR[i]/2;
  29.                 PointList.Add(tmp);
  30.             }
  31.  
  32.             //
  33.             QuickSort(ref PointList, 0, PointX.Count() - 1);
  34.             for (int i = 0; i < PointX.Count(); ++i)
  35.             {
  36.                 PointX[i] = PointList[i].Pos_x;
  37.                 PointY[i] = PointList[i].Pos_y;
  38.                 PointR[i] = PointList[i].Pos_r;
  39.                 LogWarn("" + i + ":" + PointList[i].Pos_x + " " + PointList[i].Pos_y + PointList[i].Pos_r + "", "");
  40.             }
  41.  
  42.             //
  43.             List<double> MPointX = new List<double>();
  44.             List<double> MPointY = new List<double>();
  45.             List<double> MPointR = new List<double>();
  46.  
  47.             //
  48.             MPointX.Add(PointX[4]); MPointX.Add(PointX[5]);
  49.             MPointX.Add(PointX[2]); MPointX.Add(PointX[1]); MPointX.Add(PointX[0]);
  50.             MPointX.Add(PointX[3]);
  51.             MPointX.Add(PointX[6]); MPointX.Add(PointX[7]); MPointX.Add(PointX[8]);
  52.  
  53.             //
  54.             MPointY.Add(PointY[4]); MPointY.Add(PointY[5]);
  55.             MPointY.Add(PointY[2]); MPointY.Add(PointY[1]); MPointY.Add(PointY[0]);
  56.             MPointY.Add(PointY[3]);
  57.             MPointY.Add(PointY[6]); MPointY.Add(PointY[7]); MPointY.Add(PointY[8]);
  58.  
  59.             //
  60.             MPointR.Add(PointR[4]); MPointR.Add(PointR[5]);
  61.             MPointR.Add(PointR[2]); MPointR.Add(PointR[1]); MPointR.Add(PointR[0]);
  62.             MPointR.Add(PointR[3]);
  63.             MPointR.Add(PointR[6]); MPointR.Add(PointR[7]); MPointR.Add(PointR[8]);
  64.  
  65.             //
  66.             SetDoubleList("数组定义.Value0", MPointX);
  67.             SetDoubleList("数组定义.Value1", MPointY);
  68.             SetDoubleList("数组定义.Value2", MPointR);
  69.             
  70.             //
  71.             return true;
  72.         }
  73.         catch (Exception ex)
  74.         {
  75.             LogError(GetLogPre() + ex.ToString());
  76.             return false;
  77.         }
  78.     }
  79.  
  80.     int Partition(ref List<MOTIONPOSXY_S> list, int low, int high)
  81.     {
  82.         MOTIONPOSXY_S pbase = list[low];
  83.         while (low < high)
  84.         {
  85.             while (low < high && CompareMotion_PosXy(pbase, list[high]))
  86.             {
  87.                 --high;
  88.             }
  89.             if (low < high)
  90.             {
  91.                 list[low] = list[high];
  92.             }
  93.             while (low < high && CompareMotion_PosXy(list[low], pbase))
  94.             {
  95.                 ++low;
  96.             }
  97.             if (low < high)
  98.             {
  99.                 list[high] = list[low];
  100.             }
  101.         }
  102.         list[low] = pbase;
  103.         return low;
  104.     }
  105.  
  106.     void QuickSort(ref List<MOTIONPOSXY_S> list, int low, int high)
  107.     {
  108.         if (low < high)
  109.         {
  110.             int pbase = Partition(ref list, low, high);
  111.             QuickSort(ref list, low, pbase - 1);
  112.             QuickSort(ref list, pbase + 1, high);
  113.         }
  114.     }
  115.  
  116.     //两个坐标比较大小const Test &v1, const Test &v2
  117.     bool CompareMotion_PosXy(MOTIONPOSXY_S p1, MOTIONPOSXY_S p2)
  118.     {
  119.         double difference = p1.Pos_y - p2.Pos_y;
  120.         difference = (difference >= 0 ? difference : (-difference));
  121.         if (p1.Pos_y < p2.Pos_y)
  122.         {
  123.             if (difference < 100) return (p1.Pos_x < p2.Pos_x);
  124.             else return true;
  125.         }
  126.         else if (p1.Pos_y == p2.Pos_y)
  127.         {
  128.             return (p1.Pos_x < p2.Pos_x);
  129.         }
  130.         else
  131.         {
  132.             if (difference < 100) return (p1.Pos_x < p2.Pos_x);
  133.             else return false;
  134.         }
  135.     }
  136. }

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/我家自动化/article/detail/305540?site
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号