• 대한기계학회논문집A
• /
• 제32권9호
• /
• pp.761-769
• /
• 2008

The majority of mechanical parts are manufactured by milling machines. Hence, geometrically efficient algorithms for tool path generation and physical considerations for better machining productivity with guarantee of machining safety are the most important issues in milling tasks. In this paper, an optimized path generation algorithm for direction parallel milling which is commonly used in the roughing stage is presented. First of all, a geometrically efficient tool path generation algorithm using an intersection points-graph is introduced. Although the direction parallel tool path obtained from geometric information have been successful to make desirable shape, it seldom consider physical process concerns like cutting forces and chatters. In order to cope with these problems, an optimized tool path, which maintains constant MRR in order to achieve constant cutting forces and to avoid chatter vibrations at all time, is introduced and the result is verified. Additional tool path segments are appended to the basic tool path by using a pixel based simulation technique. The algorithm has been implemented for two dimensional contiguous end milling operations, and cutting tests are conducted by measuring spindle current, which reflects machining situations, to verify the significance of the proposed method.

• 대한기계학회논문집A
• /
• 제30권2호
• /
• pp.141-148
• /
• 2006

In this paper, a new offset algorithm for closed 2D lines with islands is introduced and the result is illustrated. The main point of the proposed algorithm is that every point is set to be an offset by using bisectors, and then invalid offset lines, which are not to be participated in offsets, are detected in advance and handled with an invalid offset edge handling algorithm. As a result, raw offset lines without local invalid loops are generated. The proposed offset method is proved to be robust and simple, moreover, has a near O(n) time complexity, where n denotes the number of input lines. In addition, the proposed algorithm has been implemented and tested with 2D lines of various shapes.