收稿日期: 2010-09-21
修回日期: 2010-12-20
网络出版日期: 2011-03-01
基金资助
国家自然科学基金资助项目(51005122);航空科学基金资助项目(2008ZE52049)
Fast Search Algorithm of Pen-Cutting Regions Based on Arc Approximation
Received date: 2010-09-21
Revised date: 2010-12-20
Online published: 2011-03-01
Supported by
国家自然科学基金资助项目(51005122);航空科学基金资助项目(2008ZE52049)
李万军 赵东标 陆永华 刘凯 . 基于圆弧逼近的笔式加工区域快速搜索算法[J]. 华南理工大学学报(自然科学版), 2011 , 39(4) : 76 -81 . DOI: 10.3969/j.issn.1000-565X.2011.04.014
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
/
| 〈 |
|
〉 |