Journal of South China University of Technology (Natural Science Edition) ›› 2011, Vol. 39 ›› Issue (4): 76-81.doi: 10.3969/j.issn.1000-565X.2011.04.014

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Fast Search Algorithm of Pen-Cutting Regions Based on Arc Approximation

Li Wan-jun  Zhao Dong-biao  Lu Yong-hua  Liu Kai   

  1. Cllege of Mechanical and Electrical Engineering,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,Jiangsu,China
  • Received:2010-09-21 Revised:2010-12-20 Online:2011-04-25 Published:2011-03-01
  • Contact: 李万军(1981-)，男，博士生，主要从事数控加工技术研究 E-mail:baishikele2004@163.com
  • About author:李万军(1981-)，男，博士生，主要从事数控加工技术研究
  • Supported by:

    国家自然科学基金资助项目(51005122)；航空科学基金资助项目(2008ZE52049）

PDF

1042

Abstract:

In order to reduce the calculation complexity and improve the processing efficiency of pen-cutting process,an arc approximating method is proposed to detect the pen-cutting regions in the NC machining of freeform surfaces.In this algorithm,an improved quadtree algorithm is presented to subdivide and approximate the freefrom surface.Then,arc approximation is performed to approximately calculate the curvature radius for the purpose of quickly judging the local interference,reducing the calculation complexity and improving the search efficiency.Finally,a binary-tree method is used to exactly detect the boundary points and to determine the boundary of pen-cutting regions.Case results indicate that the proposed algorithm is effective because it can fast and accurately search the local interference regions,with a time cost reducing from the traditional 85.047s of the point-by-point searching to 33.734s.

Key words:  freeform surface, pen-cutting region, binary tree, subdivision surface