On the selection of flatness measurement points in coordinate measuring machine inspection

International Journal of Machine Tools and Manufacture

Volumn 40, Issue 3, 2000, Pages 427-443

  Kim, Weon Seok ^a   Raman, Shivakumar ^a  

^a University of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FITS AND TOLERANCES; NONDESTRUCTIVE EXAMINATION; SPATIAL VARIABLES MEASUREMENT; TRAVELING SALESMAN PROBLEM;

COORDINATE MEASURING MACHINES (CMM); FLATNESS MEASUREMENT;

MACHINE TOOLS;

EID: 0033896173     PISSN: 08906955     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-6955(99)00059-0     Document Type: Article

References (14)

1. Hammersley J.M., Handscomb D.C. Monte Carlo methods. 1964;John Wiley and Sons, Inc, New York. (pp. 25-42).
2. Lin S., Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research. 11:1973;498-516.
3. Cochran W.G. Sampling technique. 1977;John Wiley and Sons, New York.
4. Woo T.C., Liang R. Dimensional measurement of surfaces and their sampling. Computer Aided Design. 25(4):1993;233-239.
5. Woo T.C., Liang R., Hsieh C.C., Lee N.K. Efficient sampling for surface measurements. Journal of Manufacturing Systems. 14(5):1995;345-354.
6. Lee G., Mou J., Shen Y. Sampling strategy design for dimensional measurement of geometric features using coordinate measuring machine. International Journal of Machine Tools and Manufacture. 37(7):1997;917-934.
7. Lim C.P., Menq C.H. CMM feature accessibility and path generation. International Journal of Production Research. 32(3):1994;579-618.
8. Lu E., Ni J., Wu S.M. An algorithm for the generation of an optimum CMM inspection path. Transactions of the ASME. 116:1994;396-404.
9. Yau H.T., Menq C.H. Automated CMM path planning for dimensional inspection of dies and molds having complex surfaces. International Journal of Machine Tools and Manufacture. 35(6):1995;861-876.
10. Golden B., Bodin L., Doyle T., Stewart W. Approximate traveling salesman algorithms. Operations Research. 28:1977;694-711.
11. Bozer Y.A., Schorn E.C., Sharp G.P. Geometric approaches to solve the Chebyshev traveling salesman problem. IIE Transactions. 22(3):1990;238-254.
12. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing. 4:1992;387-441.
13. Sukhatme P.V., Sukhatme B.V. Sampling theory of surveys with applications. 1970;Iowa State University Press, Ames, Iowa, USA.
14. T. Soh, Efficient approaches for the large scale traveling salesman problem, M.S. Thesis, University of Oklahoma, Norman, OK, USA, 1994.