RationalDMIS 2020 迭代对齐建坐标系

2023-10-13 21:10

本文主要是介绍RationalDMIS 2020 迭代对齐建坐标系,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

在使用三坐标检测产品时我们常常会用到坐标系,而我们常见的坐标系是笛卡尔坐标系,它满足以下几个特点:

1、坐标系的三个轴向两两垂直;

2、坐标系的指向满足右手定则。

在这里插入图片描述
在建立零件坐标系的时常用的手法就是3-2-1法,将产品的零件坐标系建立在产品的基准之上。然而对于很多汽车零部件而言零件在设计时考虑到装配会按照统一的汽车坐标系设计。这时3-2-1建坐标的方法就无法满足我们的测量需求了,今天我们介绍的迭代对齐就可以有效解决这个问题

1.在模型上选取参考点

在这里插入图片描述
在这里插入图片描述

$$/*  Header
DMISMN/'Created by [爱科腾瑞科技(北京)有限公司-091521-DEMO-11022(华清)] on 星期四, 四月 08, 2021', 4.0
UNITS/MM, ANGDEC, MMPS
WKPLAN/XYPLAN
PRCOMP/ON
TECOMP/ON
FLY/1.0000
MODE/MAN
SNSET/APPRCH, 2.0000
SNSET/RETRCT, 2.0000
SNSET/DEPTH, 0.0000
SNSET/SEARCH, 10.0000
SNSET/CLRSRF, 20.0000
RECALL/D(MCS)
SNSLCT/S(40-D2)
GEOALG/BF, LSTSQR
GEOALG/ANGLB, DEFALT
GEOALG/CIRCLE, LSTSQR
GEOALG/ARC, LSTSQR
GEOALG/PLANE, LSTSQR
$$
$$
$$*/
MODE/MAN
F(PT1)=FEAT/POINT,CART,8.6562,251.7081,0.0000,0.0000,0.0000,1.0000
F(PT2)=FEAT/POINT,CART,13.0992,51.0568,0.0000,0.0000,0.0000,1.0000
F(PT3)=FEAT/POINT,CART,136.5383,32.9512,0.0000,0.0000,0.0000,1.0000
F(PT4)=FEAT/POINT,CART,186.6490,275.8631,0.0000,0.0000,0.0000,1.0000
F(PT5)=FEAT/POINT,CART,38.7520,0.0000,-4.7355,0.0000,-1.0000,0.0000
F(PT6)=FEAT/POINT,CART,149.2353,0.0000,-5.6508,0.0000,-1.0000,0.0000
F(PT7)=FEAT/POINT,CART,0.0000,43.8960,-3.4677,-1.0000,0.0000,0.0000
F(PT8)=FEAT/POINT,CART,0.0000,132.7173,-4.3188,-1.0000,0.0000,0.0000
F(PT9)=FEAT/POINT,CART,0.0000,266.2136,-6.7227,-1.0000,0.0000,0.0000
MEAS/POINT, F(PT1), 1PTMEAS/CART, 8.6562,251.7081,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT2), 1PTMEAS/CART, 13.0992,51.0568,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT3), 1PTMEAS/CART, 136.5383,32.9512,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT4), 1PTMEAS/CART, 186.6490,275.8631,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT5), 1PTMEAS/CART, 38.7520,0.0000,-4.7355,0.0000,-1.0000,0.0000
ENDMES
MEAS/POINT, F(PT6), 1PTMEAS/CART, 149.2353,0.0000,-5.6508,0.0000,-1.0000,0.0000
ENDMES
MEAS/POINT, F(PT7), 1PTMEAS/CART, 0.0000,43.8960,-3.4677,-1.0000,0.0000,0.0000
ENDMES
MEAS/POINT, F(PT8), 1PTMEAS/CART, 0.0000,132.7173,-4.3188,-1.0000,0.0000,0.0000
ENDMES
MEAS/POINT, F(PT9), 1PTMEAS/CART, 0.0000,266.2136,-6.7227,-1.0000,0.0000,0.0000
ENDMES

将所选点编写到程序中,运行程序获得点的实测值。

使用迭代对齐建坐标,首先我们需要在产品上选择6个以上的点作为参考,这些点需要分布在产品的各个方向上,最终要能够限制住产品的6个自由度。基准元素也可以使用圆,但最多只能加入2个圆参与迭代对齐。

2.设置迭代关系

在这里插入图片描述
将得到实测值的参考特征拖入元素区域,导入的模型作为理论参考拖入CAD模型栏。设置好迭代的次数和变换的目标公差,点击迭代即可完成迭代计算。完成迭代后点击添加激活坐标系,得到我们需要的坐标系。

最大迭代:迭代次数达到设置的数值后
迭代停止。

变换值:当迭代误差小于此值迭代停止。

原始LSE:是拟和前最小均方差之和。

新LSE:是拟和后最小均方差之和。

迭代:软件会自动根据CAD数模和测量点来进行坐标系的迭代运算,并根据用户输入的对齐条件,自动计算出控制CAD对齐的坐标系。
在这里插入图片描述

$$/*  Header
DMISMN/'Created by [爱科腾瑞科技(北京)有限公司-091521-DEMO-11022(华清)] on 星期四, 四月 08, 2021', 4.0
UNITS/MM, ANGDEC, MMPS
WKPLAN/XYPLAN
PRCOMP/ON
TECOMP/ON
FLY/1.0000
MODE/MAN
SNSET/APPRCH, 2.0000
SNSET/RETRCT, 2.0000
SNSET/DEPTH, 0.0000
SNSET/SEARCH, 10.0000
SNSET/CLRSRF, 20.0000
RECALL/D(MCS)
SNSLCT/S(40-D2)
GEOALG/BF, LSTSQR
GEOALG/ANGLB, DEFALT
GEOALG/CIRCLE, LSTSQR
GEOALG/ARC, LSTSQR
GEOALG/PLANE, LSTSQR
$$
$$
$$*/
MODE/MAN
F(PT1)=FEAT/POINT,CART,8.6562,251.7081,0.0000,0.0000,0.0000,1.0000
F(PT2)=FEAT/POINT,CART,13.0992,51.0568,0.0000,0.0000,0.0000,1.0000
F(PT3)=FEAT/POINT,CART,136.5383,32.9512,0.0000,0.0000,0.0000,1.0000
F(PT4)=FEAT/POINT,CART,186.6490,275.8631,0.0000,0.0000,0.0000,1.0000
F(PT5)=FEAT/POINT,CART,38.7520,0.0000,-4.7355,0.0000,-1.0000,0.0000
F(PT6)=FEAT/POINT,CART,149.2353,0.0000,-5.6508,0.0000,-1.0000,0.0000
F(PT7)=FEAT/POINT,CART,0.0000,43.8960,-3.4677,-1.0000,0.0000,0.0000
F(PT8)=FEAT/POINT,CART,0.0000,132.7173,-4.3188,-1.0000,0.0000,0.0000
F(PT9)=FEAT/POINT,CART,0.0000,266.2136,-6.7227,-1.0000,0.0000,0.0000
MEAS/POINT, F(PT1), 1PTMEAS/CART, 8.6562,251.7081,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT2), 1PTMEAS/CART, 13.0992,51.0568,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT3), 1PTMEAS/CART, 136.5383,32.9512,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT4), 1PTMEAS/CART, 186.6490,275.8631,0.0000,0.0000,0.0000,1.0000
ENDMES
MEAS/POINT, F(PT5), 1PTMEAS/CART, 38.7520,0.0000,-4.7355,0.0000,-1.0000,0.0000
ENDMES
MEAS/POINT, F(PT6), 1PTMEAS/CART, 149.2353,0.0000,-5.6508,0.0000,-1.0000,0.0000
ENDMES
MEAS/POINT, F(PT7), 1PTMEAS/CART, 0.0000,43.8960,-3.4677,-1.0000,0.0000,0.0000
ENDMES
MEAS/POINT, F(PT8), 1PTMEAS/CART, 0.0000,132.7173,-4.3188,-1.0000,0.0000,0.0000
ENDMES
MEAS/POINT, F(PT9), 1PTMEAS/CART, 0.0000,266.2136,-6.7227,-1.0000,0.0000,0.0000
ENDMES
MA(MATDEF1) = MATDEF/F(CADM_1),FA(PT1),FA(PT2),FA(PT3),FA(PT4),FA(PT5),FA(PT6),FA(PT7),FA(PT8),FA(PT9)
DMESW/COMAND, 'ITERATION/100'
D(CRD1)=LOCATE/MA(MATDEF1)
$$ Set.CAD2PCS.CADM_1
$$ Set.CADViewCenter.CADM_1

这篇关于RationalDMIS 2020 迭代对齐建坐标系的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/205880

相关文章

Python 迭代器和生成器概念及场景分析

《Python迭代器和生成器概念及场景分析》yield是Python中实现惰性计算和协程的核心工具,结合send()、throw()、close()等方法,能够构建高效、灵活的数据流和控制流模型,这... 目录迭代器的介绍自定义迭代器省略的迭代器生产器的介绍yield的普通用法yield的高级用法yidle

C++变换迭代器使用方法小结

《C++变换迭代器使用方法小结》本文主要介绍了C++变换迭代器使用方法小结,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,需要的朋友们下面随着小编来一起学习学习吧... 目录1、源码2、代码解析代码解析:transform_iterator1. transform_iterat

Mybatis从3.4.0版本到3.5.7版本的迭代方法实现

《Mybatis从3.4.0版本到3.5.7版本的迭代方法实现》本文主要介绍了Mybatis从3.4.0版本到3.5.7版本的迭代方法实现,包括主要的功能增强、不兼容的更改和修复的错误,具有一定的参考... 目录一、3.4.01、主要的功能增强2、selectCursor example3、不兼容的更改二、

Python中如何控制小数点精度与对齐方式

《Python中如何控制小数点精度与对齐方式》在Python编程中,数据输出格式化是一个常见的需求,尤其是在涉及到小数点精度和对齐方式时,下面小编就来为大家介绍一下如何在Python中实现这些功能吧... 目录一、控制小数点精度1. 使用 round() 函数2. 使用字符串格式化二、控制对齐方式1. 使用

golang内存对齐的项目实践

《golang内存对齐的项目实践》本文主要介绍了golang内存对齐的项目实践,内存对齐不仅有助于提高内存访问效率,还确保了与硬件接口的兼容性,是Go语言编程中不可忽视的重要优化手段,下面就来介绍一下... 目录一、结构体中的字段顺序与内存对齐二、内存对齐的原理与规则三、调整结构体字段顺序优化内存对齐四、内

C#使用yield关键字实现提升迭代性能与效率

《C#使用yield关键字实现提升迭代性能与效率》yield关键字在C#中简化了数据迭代的方式,实现了按需生成数据,自动维护迭代状态,本文主要来聊聊如何使用yield关键字实现提升迭代性能与效率,感兴... 目录前言传统迭代和yield迭代方式对比yield延迟加载按需获取数据yield break显式示迭

usaco 1.3 Mixing Milk (结构体排序 qsort) and hdu 2020(sort)

到了这题学会了结构体排序 于是回去修改了 1.2 milking cows 的算法~ 结构体排序核心: 1.结构体定义 struct Milk{int price;int milks;}milk[5000]; 2.自定义的比较函数,若返回值为正,qsort 函数判定a>b ;为负,a<b;为0,a==b; int milkcmp(const void *va,c

迭代器模式iterator

学习笔记,原文链接 https://refactoringguru.cn/design-patterns/iterator 不暴露集合底层表现形式 (列表、 栈和树等) 的情况下遍历集合中所有的元素

多线程篇(阻塞队列- LinkedBlockingDeque)(持续更新迭代)

目录 一、LinkedBlockingDeque是什么 二、核心属性详解 三、核心方法详解 addFirst(E e) offerFirst(E e) putFirst(E e) removeFirst() pollFirst() takeFirst() 其他 四、总结 一、LinkedBlockingDeque是什么 首先queue是一种数据结构,一个集合中

多线程篇(阻塞队列- LinkedBlockingQueue)(持续更新迭代)

目录 一、基本概要 1. 构造函数 2. 内部成员 二、非阻塞式添加元素:add、offer方法原理 offer的实现 enqueue入队操作 signalNotEmpty唤醒 删除线程(如消费者线程) 为什么要判断if (c == 0)时才去唤醒消费线程呢? 三、阻塞式添加元素:put 方法原理 图解:put线程的阻塞过程 四、非阻塞式移除:poll方法原理 dequ