Home > Papers

 
 
A tool path planning method with surface division based on cluster analysis
Pan Xin *,Cai Yujun,Li Guohe
Tianjin Key Laboratory of High Speed Cutting & Precision Machining(TUTE)
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:21 January 2014
Accepted by: none
Citation: Pan Xin,Cai Yujun,Li Guohe.A tool path planning method with surface division based on cluster analysis[OL]. [21 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4581745
 
 
It seems to be a dilemma to make full use of the surface geometry to plan high-efficiency tool paths and keep the paths smooth and easy to perform. An approach of sculpture surface division and tool path planning based on cluster analysis is proposed to try to solve the dilemma. The k-mean clustering algorithm is used to analyze the best cutting directions corresponding to the sampling points on the surface using the concept of the equivalence class. With the clustering results, the surface can be divided to a number of patches in which the best cutting directions are almost the same. It is easy to plan high-efficiency tool paths in each patch via isoplanar method or isoscallop height method. Simultaneously, the smoothness of path in each patch is guaranteed naturally. The index of improvable capacity is introduced to adjust the surface division to keep the patches regular. To compare with traditional iso-scallop height method, an example is presented to implement the approach, and the tool paths generated via the new approach achieve higher efficiency and better quality.
Keywords:Numerical control machining,Tool path planning, Cluster analysis, Surface division, Equivalence class
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 179
Bookmarked 0
Recommend 5
Comments Array
Submit your papers