Abstract
We characterize the solution of the following problem and describe an algorithm for numerically solving it. Two sets ofN points in the plane, labeled 1,...,N, are given: a fixed set of nominal points and a set of measured points. We wish to transform the messured points as a whole, by translation and rotation, so that the maximal distance between corresponding points in the two sets is minimized. This algorthm provides an accept-reject criterion that may be used together with a coordinate measuring machine to determine if two mating parts will fit, or if a part is sufficiently close to its ideal measurements. A weighted version, suitable for point-dependent tolerances, is also discussed, as is optimal joint scalling of the data.
Similar content being viewed by others
References
R.P. Brent,Algorithms for Minimization Without Derivatives (Prentice-Hall, 1973), program available from netlib.
E.W. Cheney,Introduction to Approximation Theory (McGraw-Hill, 1966).
Z. Drezner and S. Shelah, On the complexity of the Elzinga-Hearn algorithm for the 1-center problem, Math. Oper. Res. 12 (1987) 255–261.
G.H. Golub and C.F. Van Loan,Matrix Computations, 2nd ed. (Johns Hopkins University Press, 1989).
R. Hanson and M.J. Norris, Analysis of measurement based on the singular value decomposition, SIAM J. Sci. Stat. Comp. 2 (1981) 363–373.
D.W. Hearn and J. Vijay, Efficient algorithms for the (weighted) minimum circle problem, Oper. Res. 30 (1982) 759–777.
E. Isaacson and H.B. Keller,Analysis of Numerical Methods (Wiley, 1966).
F.P. Preparata and M.I. Shamos,Computational Geometry: An Introduction (Springer, 1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zwick, D. A planar minimax alogrithm for analysis of coordinate measurements. Adv Comput Math 2, 375–391 (1994). https://doi.org/10.1007/BF02521605
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02521605
Keywords
- Minimax fit
- coordinate measurements
- quality control
- accept-reject procedure
- smallest enclosing circle (SEC)