DocumentCode :
519327
Title :
Evaluation of Planar Straightness Error: Analysis on Convex Edge
Author :
Meng, Jiang ; An, Kun
Author_Institution :
Sch. of Mech. Eng. & Automatization, North Univ. of China, Taiyuan, China
Volume :
1
fYear :
2010
fDate :
5-6 June 2010
Firstpage :
89
Lastpage :
92
Abstract :
To present a precise and efficient algorithm to solve planar straightness error problems, two theorems are developed in this paper as the basis of the following algorithm. Theorems 1 and 2 provide the slope condition of convex edges in a polygon produced by the measured points, which is a quite easy and feasible way to satisfy the minimum zone criteria. The accuracy of the proposed algorithm is validated through three widely-used datasets and the linear computation complexity is verified with quite a large number of measured points.
Keywords :
computational complexity; convex programming; measurement errors; convex edge analysis; linear computation complexity; planar straightness error evaluation; slope condition; Algorithm design and analysis; Automatic control; Coordinate measuring machines; Electronic mail; Error analysis; Error correction; Industrial engineering; Joining processes; Mechanical engineering; Rubber; convex edges; convex polygon; minimum zone criteria; straightness error evaluation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing, Control and Industrial Engineering (CCIE), 2010 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-0-7695-4026-9
Type :
conf
DOI :
10.1109/CCIE.2010.30
Filename :
5492039
Link To Document :
بازگشت