岳武陵
吳勇
南通大學(xué)機(jī)械工程學(xué)院,江蘇南通226007
摘 要:在平面度（直線度）誤差評(píng)定的最小包容區(qū)域法中,提出一個(gè)新的、快速的實(shí)施方法——增量算法。該法以計(jì)算幾何中凸殼的理論為依據(jù),結(jié)合平面度（直線度）誤差評(píng)定中數(shù)據(jù)的特點(diǎn),從4個(gè)（3個(gè)）測點(diǎn)的子集開始,通過評(píng)定子集的平面度（直線度）以及增加距子集包容面最遠(yuǎn)的點(diǎn)構(gòu)成新的子集的方法,逐步逼近精確解。該算法單調(diào)遞增收斂到精確解,時(shí)間復(fù)雜度為O（n1）。幾個(gè)算例證實(shí)了方法和結(jié)論的正確性。[著者文摘]
A Fast Evaluation Method for Flatness and Straightness Tolerance by Means of Incremental AlgorithmYUE Wu-ling, WU Yong College of Mechanical Engineering, Nantong University, Nantong, Jiangsu 226007, ChinaAbstract:A fast and accurate method called incremental algorithm is proposed to implement the minimum zone tolerance for evaluating flatness or straightness errors. The algorithm is based on the convex - hull theory in computational geometry and also explores the properties of the measurement data. The algorithm starts from a subset with four （three） measurement points. If the bounding flats or straights determined by current subset can cover the whole remaining set, the distance between the bounding planes （lines） is the final accurate flatness （straightness）. Otherwise, put the point with maximum distance from the bounding planes into current subset, and repeat the previous step for the new subset. It is proved that the sequence of flatness （straightness） of these subsets monotonously increasingly converges to the accurate result. The timing complexity is only O （n1）. Several examples verify the correctness of this algorithm.[著者文摘]
Key words:Metrology ; Tolerance evaluation; Flatness ; Straightness ; Minimum zone ; Incremental algorithm |
|
收藏
贊
踩
閩公網(wǎng)安備 35020602000072號(hào)