• 한국CDE학회논문집
• /
• 제6권4호
• /
• pp.215-221
• /
• 2001

In the zigzag milling of a pocket having islands, tool retraction is one of the primary factors that decrease productivity. Therefore, tool path with minimum number of tool retraction has been needed. Most researches about this topic have been concentrated on obtaining the optimum solution formulated through the geometric reasoning off pocket. Recently, several attempts were made to simplify this problem into region partitioning in order to get the numerically expressed minimum solution. In this research, a method reducing the number of tool retractions extended from existing region partitioning is provided. Applying the segment that is normal to the reference direction of zigzag milling, region partitioning is carried out and structural elements of the region are searched via graphs of islands and characteristic points. Through the processes presented, the number of region partitioned is less than that of existing processes.

• 한국CDE학회논문집
• /
• 제6권3호
• /
• pp.169-173
• /
• 2001

Presented in this paper is a CPO tool-path linking procedure optimizing technological objectives, such as dealing with islands (positive and negative) and minimizing tool retractions, drilling holes and slotting. Main features of the proposed algorithm are as follows; 1) a data structure, called a 'TPE-net', is devised to provide information on the parent/child relationships among the tool-path-elements, 2) the number of tool retractions is minimized by a 'tool-path-element linking algorithm'fading a tour through the TPE-net, and 3) the number of drilling holes is minimized by making use of the concept of the 'free space'.

• International Journal of Precision Engineering and Manufacturing
• /
• 제3권4호
• /
• pp.31-36
• /
• 2002

A continuous tool-path, that is to cut continuously with the minimum number of cutter retractions during the cutting operations, is developed in order to minimise the fluctuation of cutting load and the possibility of chipping on the cutting edge in HSM (high-speed machining). This algorithm begins with the offset procedure along the boundary curve of the sculptured surface being machined. In the of offset procedure, the offset distance is determined such that the scallop height maintains a constant roughness to ensure higher levels of efficiency and quality in high-speed machining. Then, the continuous path is generated as a kind of the diagonal curve between the offset curves. This path strategy is able to connect to neighbor paths without cutter retractions. Therefore, the minimum tool retraction tool-path can be generated And, it allows the sculptured surface incorporating both steep and flat areas to be high-speed machined.

• 한국CDE학회논문집
• /
• 제11권5호
• /
• pp.375-383
• /
• 2006

Presented in this paper is a new fast and robust algorithm generating NC tool path for 2D pockets with islands. The input shapes are composed of line segments and circular arcs. The algorithm has two steps: creation of successive offset loops and linking the loops to a tool path. A modified pairwise technique is developed in order to speed up and stabilize the offset process, and the linking algorithm is focused on avoiding thin-wall cutting and minimizing tool retractions. The proposed algorithm has been implemented in C++ and some illustrative examples are presented to show the practical strength of the algorithm.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.200-207
• /
• 2003

Presented in this paper is a new fast and robust algorithm generating NC tool path for 2D pockets with islands. The input shapes are composed of line segments and cricular arcs. The algorithm has two steps: creation of successive offset loops and linking the loops to tool path. A modified pair-wise technique is developed in order to speed up and stabilize the offset process, and the linking algorithm is focused on minimizing tool retractions and preventing thin-wall rotting The proposed algorithm has been implemented In C++ and some illustrative examples are presented to show the practical strength of the algorithm.