NX二次开发将输入的曲线或边分成一组一组的相连曲线或边

曹大师

已于 2024-05-07 19:13:24 修改

阅读量148

点赞数 3

分类专栏： UFUN 文章标签： NX二次开发

于 2024-05-06 11:25:47 首次发布

本文链接：https://blog.csdn.net/qq_39541524/article/details/138488603

版权

UFUN 专栏收录该内容

24 篇文章 14 订阅

订阅专栏

vector<tag_t> GetLinkCurves(vector<tag_t>&curves)
{
   vector<tag_t>linkcurves;
   linkcurves.push_back(curves[0]);//把第一条拿出来作为要查找的依据
   curves.erase(curves.begin());
   if(curves.empty())//没有就不找
   {
      return linkcurves;
   }
   if(UF_MODL_ask_curve_closed(linkcurves[0]))return linkcurves;//第一条曲线是封闭曲线就没必要往下找
   int num;
   double* pt;
   UF_MODL_ask_curve_points(linkcurves[0],0,0,0,&num,&pt);//获取端点
   double startpoint[3]={pt[0],pt[1],pt[2]};
   double endpoint[3]={pt[3*num-3],pt[3*num-2],pt[3*num-1]};
   for(int i=0;i<curves.size();i++)
   {
       if(!UF_MODL_ask_curve_closed(curves[i]))
       {
          UF_MODL_ask_curve_points(curves[i],0,0,0,&num,&pt);
          double tempstartpoint[3]={pt[0],pt[1],pt[2]};
          double tempendpoint[3]={pt[3*num-3],pt[3*num-2],pt[3*num-1]};
          double dis=0;
          UF_VEC3_distance(startpoint,tempstartpoint,&dis);
          if(dis<0.025)
          {
             linkcurves.push_back(curves[i]);
             curves.erase(curves.begin()+i);
             i=-1;
             UF_VEC3_copy(tempendpoint,startpoint);
             continue;
             
          }
          UF_VEC3_distance(startpoint,tempendpoint,&dis);
          if(dis<0.025)
          {
             linkcurves.push_back(curves[i]);
             curves.erase(curves.begin()+i);
             i=-1;
             UF_VEC3_copy(tempstartpoint,startpoint);
             continue;
          }
          UF_VEC3_distance(endpoint,tempstartpoint,&dis);
          if(dis<0.025)
          {
             linkcurves.push_back(curves[i]);
             curves.erase(curves.begin()+i);
             i=-1;
             UF_VEC3_copy(tempendpoint,endpoint);
             continue;
          }
          UF_VEC3_distance(endpoint,tempendpoint,&dis);
          if(dis<0.025)
          {
             linkcurves.push_back(curves[i]);
             curves.erase(curves.begin()+i);
             i=-1;
             UF_VEC3_copy(tempstartpoint,endpoint);
             continue;
          }
       }
   }
   return linkcurves;
}
vector<vector<tag_t>>LINKCURVES(vector<tag_t>&curves)
{
     vector<vector<tag_t>>linkcurves;
     while(!curves.empty())//等于空退出循环
     {
        linkcurves.push_back(GetLinkCurves(curves));
     }
     return linkcurves;
}

//测试代码
vector<TaggedObject*>edges=SelEdge->GetSelectedObjects();
vector<tag_t>edgetags;
for(int i=0;i<edges.size();i++)
{
  edgetags.push_back(edges[i]->Tag());
}
char msg[256];
sprint_s(msg,"%f",LINKCURVES(edgetags).size());
uc1601(msg,1);