Skip to main content
SpringerLink
Log in

A planar minimax alogrithm for analysis of coordinate measurements

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.P. Brent,Algorithms for Minimization Without Derivatives (Prentice-Hall, 1973), program available from netlib.

  2. E.W. Cheney,Introduction to Approximation Theory (McGraw-Hill, 1966).

  3. 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.

    MATH  MathSciNet  Google Scholar 

  4. G.H. Golub and C.F. Van Loan,Matrix Computations, 2nd ed. (Johns Hopkins University Press, 1989).

  5. R. Hanson and M.J. Norris, Analysis of measurement based on the singular value decomposition, SIAM J. Sci. Stat. Comp. 2 (1981) 363–373.

    Article  MATH  MathSciNet  Google Scholar 

  6. D.W. Hearn and J. Vijay, Efficient algorithms for the (weighted) minimum circle problem, Oper. Res. 30 (1982) 759–777.

    Article  MathSciNet  Google Scholar 

  7. E. Isaacson and H.B. Keller,Analysis of Numerical Methods (Wiley, 1966).

  8. F.P. Preparata and M.I. Shamos,Computational Geometry: An Introduction (Springer, 1985).

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Vermont, 05401-1455, Burlington, VT, USA

    D. Zwick

Authors
  1. D. Zwick
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02521605

Keywords

AMS(MOS) subject classification

Search

Navigation