Home|News|Literature|Journal|Instruction|Forum|Member|Introduction

Chinese  Old version

By    In    Search 

  HomeContents of Chinese Journal of Mechanical Engineering 2006 No.7Secant algorithm in Multi-point contact machining

Secant algorithm in
Multi-point contact machining

 

WANG Ruiqiu  CHEN Wuyi

(School of Mechanical Engineering and Automation, Beihang University, Beijing 100083)

 

Abstract: In order to acquire a universal multi-point contact machining alogrithm and reduce the computation cost, the prin ciple of algorithm realizing multi-point contact between the toroidal outter and the machining surface is analyzed. And the method positioning the toroidal cutter is derived. A novel algorithm, for machining error controlling in multi-point contact machining, is proposed. In the algorithm, a function equation having the radius of the circle of the parameter difference between two contact points as the independent variable is constructed to control the maximal undercut error occurring within the two contact points in multi-point contact machining. The secant algorithm is utilized to solve the equation after iterations,and then the optimal value of the circle radius and cutter location is derived. It is proved by a computational example that very wide path intervals can be acquired when secant algorithm is applied in tool position calculation with multi-point method. The time cost of secant algorithm is much less than that of Hermite method. And it is more effective in the application on the sculpture surface machining.

Key words:NC machining  Multi-point contact machining  Secant algorithm  Tool position calculation

CLC No: TP391

中国航空第一集团创新基金资助项目(CX03007). Received 20050809, received in revised form 20060221

 
Open or Download Full Text of this Paper (PDF File)
 
  About us-Contact us-Site map-Advertisement service-Cooperation-Legal statement  

Address: 22 Baiwanzhuang Dajie, Beijing 100037 China    Tel: 8610-88379907    Fax: 8610-68994557

E-mail: cjme@mail.machineinfo.gov.cn  http: //www.cjmenet.com
©2006 Editorial Office of CJME. All Right Reserved