.png){kind=icon}
.png){kind=icon}
Return
A combinatorial optimization approach for evaluating minimum-zone spatial straightness errors
.png){kind=icon}
PRE
AI
DOI：10.1016/j.measurement.2012.01.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new and robust approach for the accurate evaluation of minimum-zone spatial straightness error from a set of coordinate measurement data points. The algorithm iteratively searches for the specific data points that define the minimum bound of the spatial straightness zone using combinatorial optimization. It is based on the fact that the minimum circumscribed cylinder of a point set, which is equivalent to the minimum spatial straightness zone of the measurement data, will pass through three, four, or five of the data points that constitute the convex hull vertices of the entire data set. Computed results have shown that although the presented approach may lead to increased computational time, it is robust and able to construct the exact minimum circumscribed cylinder for a given point set. The minimum-zone spatial straightness error can thus be evaluated with the best possible accuracy. The advantage of the presented algorithm is demonstrated via comparison with published computed results of existing algorithms. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Spatial straightness
Minimum circumscribed cylinder
Geometric inspection
Combinatorial optimization
Convex hull
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.6
Papers:
1.9W
Citations:
5.4W
Organization
View more organizations