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);
NX二次开发--将输入的曲线或边分成一组一组的相连曲线或边
于 2024-05-30 14:39:48 首次发布