서지주요정보
최소분리영역 기준에 근거한 원뿔의 기하학적 형상 오차 평가 = Geometric form evaluation of cone based on the minimum zone criteria
서명 / 저자 최소분리영역 기준에 근거한 원뿔의 기하학적 형상 오차 평가 = Geometric form evaluation of cone based on the minimum zone criteria / 김형민.
발행사항 [대전 : 한국과학기술원, 1997].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8007609

소장위치/청구기호

학술문화관(문화관) 보존서고

MME 97029

휴대폰 전송

도서상태

이용가능(대출불가)

사유안내

반납예정일

리뷰정보

초록정보

ISO definition for form tolerances requires the form error of a geometry to be less than some specific limit. Most inspectors measure form tolerances as the minimum zone solution which minimizes the maximum deviations between the measured points and the estimated feature. Current Coordinate Measuring Machines (CMMs) measure the form error based on the least square method, which minimizes the sum of the squared errors between the measured points and the estimated feature, possibly resulting in some overestimations on the errors. The form evaluation algorithm for the conical geometry developed in this thesis computes the minimum zone solution based on the ISO standards, which is inherently a nonlinear optimization problem with local minimums. The developed algorithm consists of two phases. The first phase is to find good initial values for the cone geometry. Disregarding the angular components of the measured data points, 3-D data points are mapped into 2-D data points. From the 2-D points, least square line can be fitted and the tolerance zone with respect to the line can be calculated. Comparing the tolerance zone, the cone axis which has the smallest tolerance zone can be obtained. With these information, initial values for the cone geometric factors can be fixed. The second phase is to search geometric factors for the minimum zone cone with the initial values from the first phase. The problem is formulated as a constrained nonlinear optimization problem, which finds two nearest coaxial cones locating all the measured data points between the two cones, which satisfies the ISO minimum zone criteria. At each phase, the nonlinear constrained optimization problem is solved by sequential quadratic programming (SQP). Using the adequate initial values from the first phase of the present algorithm, the minimum zone solution can be efficiently and conveniently obtained. Lots of numerical examples are presented in this thesis, which show that this cone evaluation algorithm meets the ISO requirements and that the present algorithm is reliable and efficient for the geometric evaluation of cone.

서지기타정보

서지기타정보
청구기호 {MME 97029
형태사항 v, 60 p. : 삽화 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Hyung-Min Kim
지도교수의 한글표기 : 이병채
지도교수의 영문표기 : Byung-Chai Lee
학위논문 학위논문(석사) - 한국과학기술원 : 기계공학과,
서지주기 참고문헌 : p. 58-60
QR CODE

책소개

전체보기

목차

전체보기

이 주제의 인기대출도서