Interference-free NC machining using spatial planning and Minkowski operations

Abstract NC machining involves a description of the erosion of a stock of material by the milling tool as well as interference avoidance between tool holder and the stock, and between the tool and the model of the result to be obtained. In spatial planning an object is placed or moved among one or more obstacles without interfering with them. The object is shrunk to a point o and the obstacles are dilated with the object. The dilated obstacles then represent the forbidden region as the complement of the free space in which o can be positioned. Hence, interference avoidance for NC machining involves both a tool holder spatial planning problem and a tool spatial planning problem. In the tool holder spatial planning problem the tool holder is the object and the stock is the single obstacle. In the tool spatial planning problem the tool is the object and the model of the result to be obtained is the single obstacle. In both problems the tool holder and the tool are shrunk to the same point o . Then the forbidden region for positioning o is the union of the dilated stock and the dilated model and the tool path is extracted from the boundary between the forbidden region and the free space. In the field of mathematical morphology the Minkowski addition and subtraction provide a formalism to describe dilation and erosion. In this paper we apply this formalism to state the NC machining problem, and to describe, implement and compare two important grid height machining methods. We illustrate these methods with some practical examples.

[1]  Jordan J. Cox,et al.  Space-filling curves in tool-path applications , 1994, Comput. Aided Des..

[2]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[3]  Karl T. Ulrich,et al.  Evaluating prototyping technologies for product design , 2018 .

[4]  Yong Se Kim,et al.  COMPUTERS IN ENGINEERING , 1994 .

[5]  Chih-Hsing Chu,et al.  An automatic path generation method of NC rough cut machining from solid models , 1995 .

[6]  Edward R. Dougherty,et al.  Morphological methods in image and signal processing , 1988 .

[7]  Joseph N. Wilson,et al.  Handbook of computer vision algorithms in image algebra , 1996 .

[8]  Jai Menon,et al.  More powerful solid modeling through ray representations , 1994, IEEE Computer Graphics and Applications.

[9]  Mark H. Overmars,et al.  Freeform Shape Machining Using Minkowski Operations , 1996 .

[10]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[11]  Johan W. H. Tangelder,et al.  Robot machines rapid prototype , 1996 .

[12]  Stephen Mann,et al.  A classified bibliography of literature on NC milling path generation , 1997, Comput. Aided Des..

[13]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[14]  Takafumi Saito,et al.  NC machining with G-buffer method , 1991, SIGGRAPH.

[15]  Pijush K. Ghosh,et al.  A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations , 1990, Comput. Vis. Graph. Image Process..

[16]  Byoung Kyu Choi,et al.  Application and Extension of Z-Map Model , 1995 .

[17]  John G. Griffiths,et al.  Toolpath based on Hilbert's curve , 1994, Comput. Aided Des..

[18]  Gershon Kedem,et al.  Application of the Ray-Representation and a Massively Parallel Special Purpose Computer to Problems of Protein Structure and Function: I. Methodology for Calculation of Molecular Contact Surface, Volume, and Internal Free Space , 1994 .