UG二次开发 UFUN 找出在指定坐标系下的包容块的最小值和最大值

最新推荐文章于 2024-08-09 18:19:33 发布

城市泊客

最新推荐文章于 2024-08-09 18:19:33 发布

阅读量297

点赞数 1

分类专栏： UG二次开发 UFUN 文章标签： c++ 学习方法制造个人开发

本文链接：https://blog.csdn.net/xc52477235/article/details/132964863

版权

UG二次开发 UFUN 专栏收录该内容

48 篇文章 18 订阅

订阅专栏

bool Ask_Obj_BoundingBox(tag_t obj, tag_t csysTag, double Box[6])
{
double minConner[3] = { 0.0,0.0,0.0 };
double maxConner[3] = { 0.0,0.0,0.0 };
double dir[3][3] = { 0.0 };
double dis[3] = { 0.0,0.0,0.0 };
double tempP1[3] = { 0.0,0.0,0.0 };
double tempP2[3] = { 0.0,0.0,0.0 };
UF_MODL_ask_bounding_box_exact(obj, csysTag, minConner, dir, dis);
UF_VEC3_affine_comb(minConner, dis[0], dir[0], tempP1);
UF_VEC3_affine_comb(tempP1, dis[1], dir[1], tempP2);
UF_VEC3_affine_comb(tempP2, dis[2], dir[2], maxConner);
UF_CSYS_map_point(UF_CSYS_ROOT_COORDS, minConner, UF_CSYS_ROOT_WCS_COORDS, minConner);
UF_CSYS_map_point(UF_CSYS_ROOT_COORDS, maxConner, UF_CSYS_ROOT_WCS_COORDS, maxConner);

Box[0] = minConner[0];
Box[0] = minConner[0];
Box[0] = minConner[0];
Box[0] = minConner[0];
Box[0] = minConner[0];
Box[0] = minConner[0];
return true;
}