Tool-path generation from measured data

Presented in the paper is a procedure through which 3-axis NC tool-paths (for roughing and finishing) can be directly generated from measured data (a set of point sequence curves). The rough machining is performed by machining volumes of material in a slice-by-slice manner. To generate the roughing tool-path, it is essential to extract the machining regions (contour curves and their inclusion relationships) from each slice. For the machining region extraction, we employ the boundary extraction algorithm suggested by Park and Choi (Comput.-Aided Des. 33 (2001) 571). By making use of the boundary extraction algorithm, it is possible to extract the machining regions with O(n) time complexity, where n is the number of runs. The finishing tool-path can be obtained by defining a series of curves on the CL (cutter location) surface. However, calculating the CL-surface of the measured data involves time-consuming computations, such as swept volume modeling of an inverse tool and Boolean operations between polygonal volumes. To avoid these computational difficulties, we develop an algorithm to calculate the finishing tool-path based on well-known 2D geometric algorithms, such as 2D curve offsetting and polygonal chain intersection algorithms.

[1]  Y. C. Chung,et al.  Offset tool-path linking for pocket machining , 2002, Comput. Aided Des..

[2]  Margaret K. Guyder.  Automating the optimization of 2 1 2 axis milling , 1990 .

[3]  F Xi,et al.  CAD-based path planning for 3-D line laser scanning , 1999, Comput. Aided Des..

[4]  Martin Held,et al.  On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.

[5]  S. T. Tan,et al.  Using dexels to make hollow models for rapid prototyping , 1998, Comput. Aided Des..

[6]  Christoph M. Hoffmann,et al.  How to Compute Offsets Without Self-Intersection , 1991 .

[7]  Andrew W. Fitzgibbon,et al.  High-level model acquisition from range images , 1997, Comput. Aided Des..

[8]  Ralph R. Martin,et al.  Reverse engineering of geometric models - an introduction , 1997, Comput. Aided Des..

[9]  Byoung Kyu Choi,et al.  Analysis of difference fairing based on DFT-filter , 2001, Comput. Aided Des..

[10]  Colin Bradley,et al.  Segmentation of a wrap-around model using an active contour , 1997, Comput. Aided Des..

[11]  Sang C. Park,et al.  Uncut free pocketing tool-paths generation using pair-wise offset algorithm , 2001, Comput. Aided Des..

[12]  Alan C. Lin,et al.  Automatic generation of NC cutter path from massive data points , 1998, Comput. Aided Des..

[13]  Hong-Tzong Yau,et al.  Automated CMM path planning for dimensional inspection of dies and molds having complex surfaces , 1995 .

[14]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[15]  Sang C. Park,et al.  Polygonal chain intersection , 2002, Comput. Graph..

[16]  Robert B. Jerard,et al.  Sculptured Surface Machining , 1998 .

[17]  Sang C. Park,et al.  A pair-wise offset algorithm for 2D point-sequence curve , 1999, Comput. Aided Des..

[18]  Sang C. Park,et al.  Boundary extraction algorithm for cutting area detection , 2001, Comput. Aided Des..

[19]  Sang C. Park,et al.  Tool-path planning for direction-parallel area milling , 2000, Comput. Aided Des..