Advertisement

A fast and simple algorithm for evaluation of minimum zone straightness error from coordinate data

  • P. B. Dhanish
  • Jose Mathew
ORIGINAL ARTICLE

Abstract

Various methods have been suggested in the past to determine the minimum zone straightness error, but suffer from various drawbacks. A new, fast and simple algorithm is proposed to calculate the straightness error from planar coordinate data. It guarantees the minimum zone solution. An example and test data are provided. Results of simulation experiments to establish the time computational complexity of the algorithm are also presented.

Keywords

CMM Algorithm Straightness error 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    ISO (1983) Technical drawings—geometrical tolerancing—tolerancing of form, orientation, location and run-out-generalities, definitions, symbols, indications on drawings. ISO 1101:1983. International Organization for Standardization, GenevaGoogle Scholar
  2. 2.
    Walker RK (1988) CMM form tolerance algorithm testing. GIDEP Alert, #X1-A-88-01A, Government-Industry Data Exchange Program, Pomona, CAGoogle Scholar
  3. 3.
    Murthy TSR, Abdin SZ (1980) Minimum zone evaluation of surfaces. Int J Mach Tool Des Res 20:123–136CrossRefGoogle Scholar
  4. 4.
    Dhanish PB, Shunmugam MS (1991) An algorithm for form error evaluation—using the theory of discrete and linear Chebyshev approximation. Comput Method Appl M 92:309–324CrossRefGoogle Scholar
  5. 5.
    Carr K, Ferreira P (1995) Verification of form tolerances part I: basic issues, flatness, and straightness. Precis Eng 17:131–143CrossRefGoogle Scholar
  6. 6.
    Cheraghi SH, Lim HS, Motavalli S (1996) Straightness and flatness tolerance evaluation: an optimization approach. Precis Eng 18:30–37CrossRefGoogle Scholar
  7. 7.
    Suen DS, Chang CN (1997) Application of neural network interval regression method for minimum zone straightness and flatness. Precis Eng 20:196–207CrossRefGoogle Scholar
  8. 8.
    Samuel GL, Shunmugam MS (1999) Evaluation of straightness and flatness error using computational geometric techniques. Comput Aided D 31:829–843CrossRefGoogle Scholar
  9. 9.
    Orady E, Li S, Chen Y (2000) Evaluation of minimum zone straightness by a nonlinear optimization method. J Manuf Sci E-T ASME 122:795–797CrossRefGoogle Scholar
  10. 10.
    Chen M-C, Fan S-KS (2002) Tolerance evaluation of minimum zone straightness using non-linear programming techniques: a spreadsheet approach. Comput Ind Eng 43:437–453CrossRefGoogle Scholar
  11. 11.
    Huang J (2003) An efficient approach for solving the straightness and the flatness problems at large number of data points. Comput Aided D 35:15–25CrossRefGoogle Scholar
  12. 12.
    Skiena SS (1997) The algorithm design manual. Springer, Berlin Heidelberg NewYork. http://www2.toki.or.id/book/AlgDesignManual/BOOK/BOOK2/NODE91.HTM. Cited 11 January 2006
  13. 13.
    Liu CH, Chen CK, Jywe WY (2001) Evaluation of straightness and flatness using a hybrid approach—genetic algorithms and the geometric characterization method. P I Mech Eng B-J Eng 215:377–382. DOI: 10.1243/0954405011515442Google Scholar
  14. 14.
    Stiefel E (1959) Über diskrete und lineare Tschebycheff-Approximationen. Numer Math 1:1–29CrossRefMathSciNetGoogle Scholar
  15. 15.
    Aho A, Hopcroft J, Ullman J (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, pp 2–3zbMATHGoogle Scholar
  16. 16.
    Montgomery DC (2001) Design and analysis of experiments. Wiley, New York, p 170Google Scholar
  17. 17.
    AutoHotKey (2005) AutoHotKey v. 1.0.29.00. http://www.autohotkey.com. Cited 11 January 2006
  18. 18.
    McGeoch C (1992) Analyzing algorithms by simulation: variance reduction techniques and simulation speedups. ACM Comput Surv 24(2):195–212CrossRefGoogle Scholar
  19. 19.
    Martin WA (1971) Sorting. ACM Comput Surv 3(4):147–174CrossRefGoogle Scholar
  20. 20.
    Lang HW (1997) Sorting algorithms, heapsort. http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/heap/heapen.htm.Cited 11 January 2006

Copyright information

© Springer-Verlag London Limited 2006

Authors and Affiliations

  1. 1.Department of Mechanical EngineeringNational Institute of Technology Calicut CalicutIndia

Personalised recommendations