METHOD OF SPECIFYING THREE-DIMENSIONAL CURVE

Abstract: A method of specifying a three-dimensional curve includes a step of input data specifying a first projected curve (CV₁) and a second projected curve (CV₂) which are formed when a three-dimensional curve (31a) is projected onto each of two adjacent planes in Cartesian coordinates (e.g., an XY plane and a YZ plane), a step of obtaining coordinates (a i , b i ,) of an ith (i = 1, 2 ...) division point (P i ) of division points which divide the first projected curve (CV₁) into a large number of line elements, a step of obtaining coordinates (b i , c i ) of a point (Q i ) on the second projected curve (CV₂) which has the coordinate (b₁) along the common axis (the Y-axis) of the coordinate axes of the two adjacent planes, and a step of specifying the three-dimensional curve (31a) using a set of points (R₁) with three-dimensional coordinates (a i , b i , c i ).

Description: This invention relates to a numerical control method comprising specifying a three-dimensional curve of an article to be machined and, more particularly but not exclusively, to a method of specifying a three-dimensional curve that is ideal for the creation of an NC tape required for the numerically controlled machining of a three-dimensional metal mold or the like. A curved surface of a three-dimensional metal mold or the like on a design drawing is generally expressed by a plurality of section curves, but no profile data is shown for the shape of the area lying between a certain section curve and the next adjacent section curve. In numerically controlled machining it is essential that machining be carried out so as to smoothly connect these two section curves despite the fact that the profile between them is not given. In other words, this means that machining must be performed by generating the curved surface between the two section curves from such data as that indicative of the section curves, recording on an NC tape the data concerning the generated curved surface, and carrying out machining in accordance with commands from the NC tape. To this end, the applicant has proposed in U.S. Serial No. 266,284 (see Japanese Patent Application No. 55-78247), and has put into practice, a method of creating curved surfaces, comprising generating a plurality of intermediate sections and finding a section curve (intermediate section curve) on a curved body, based on the intermediate sections, in accordance with predetermined rules, from section data specifying given sections of a three-dimensional curved body and from data specifying section curves in said sections, and generating the curved surface of the three-dimensional body based on the plurality of generated intermediate section curves. This prior-art method will be described with reference to Fig. 1. The method includes giving section curves 11a, 12a in two sections 11, 12 and a reference curve 21a in a reference section 21, moving the first section curve 11a of the two given section curves 11a, 12a along the reference curve 21a while the curve is being transformed so as to be superposed on the second section curve 12a, and creating a curved surface, which is formed owing to said movement, as an assemblage of a plurality of intermediate section curves. In generating the intermediate section curves, the first and second section curves 11a, 12a are brought into uniform correspondence with each other in their entirety. Specifically, when each of the section curves is partitioned into M segments, i-th (i=1, 2, ...) partition points P i , Q i of the respective curves are made to correspond to each other and each of the intermediate sections curves is generated by using the corresponding relation. However, since the prior-art method is adapted to generate a curved surface by giving the reference curve 21a in the reference section (a plane), curved surface generation cannot be performed in a case where a reference curve 31a is a three-dimensional curve, as shown in Fig. 2. In Fig. 2, numerals 11, 12 denote sections, 11a, 12a section curves, 41 an intermediate section, and 41a an intermediate section curve. Accordingly, an object of the present invention is to provide a three-dimensional curve specifying method whereby a three-dimensional curve can be specified in a simple manner, and which is well-suited for application to curved surface generation in cases where a reference curve is a three-dimensional curve. According to the present invention there is provided a numerical control method comprising specifying a three-dimensional curve of an article to be machined, by the steps of entering data specifying first and second curves which are the projections of the three-dimensional curve onto two mutually orthogonal planes (e.g., an XY plane and a YZ plane) in a rectangular coordinate system, partitioning the first curve into a number of line segments and finding coordinate values a i ,b i of an i-th (i=1, 2,...) partition point P i , finding coordinate values b i ,c i of a point Qi on the second curve having a coordinate value b i on the coordinate axis (eg Y axis) which is common to the two planes, and specifying the aforementioned three-dimensional curve by the three-dimensional coordinate values a i , b i , c i (i=1, 2,...). Brief Description of the Drawings Fig. 1 is a view for describing a conventional method, Fig. 2 shows an example of a three-dimensional curved surface and is useful in describing a drawback of the conventional method, Fig. 3 is a view for describing the outline of the present invention, Fig. 4 is a block diagram of a three-dimensional curve generating apparatus for practicing the method of the present invention, Fig. 5 is a flowchart of processing for generating a three-dimensional curve according to the present invention, and Fig. 6 is a view for describing a method of specifying a curve in a plane. Processing for specifying a three-dimensional curve according to the present invention is broadly classified into the following processes (a) - (d), with reference being had to Fig. 3: (a) input processing for projecting the three-dimensional curve 31a onto two mutually adjacent (ie orthogonal) planes (e.g., an X-Y plane and a Y-Z plane) in a rectangular coordinate system, and for entering a first curve CV₁ and a second curve CV₂ comprising the projections, each of the curves being approximated by straight lines and circular arcs; (b) partition point processing for successively partitioning the first curve CV₁ from a starting point P s to an end point P e by a separately entered partitioning pitch, and for finding coordinate values (a i ,b i ) of each partition point P i ; (c) processing for finding coordinate values (b i ,c i ) of a point Q i on the second curve CV₂ having a partition point coordinate value b i on a common axis (Y axis) from among the coordinate axes of the two adjacent planes; and (d) processing for storing a point R i (a i ,b i ,c i ) (i=1, 2, 3,...) on the three-dimensional curve 31a to specify the three-dimensional curve. Each of the foregoing process steps will now be described in conjunction with Fig. 3, a block diagram of a three-dimensional curve creating apparatus shown in Fig. 4, and a processing flowchart shown in Fig. 5. In Fig. 4, numeral 101 denotes a keyboard, 102 a three-dimensional curve generating apparatus, and 103 a curved surface generating unit which receives created three-dimensional curve data as an input. The three-dimensional curve generating apparatus 102 includes a RAM 102a, processor 102b, a ROM 102c, a working memory 102d, and a data memory 102e for storing three-dimensional curve data. (a) Projection curve data input processing (a)-1 As shown in Fig. 6, assume that the first curve CV₁ obtained by the projection onto the X-Y plane is composed of circular arcs C₁, C₂, C₃, straight lines L₁, L₂... successively connected one to the next, that the starting and end points of each of the circular arcs C₁, C₂, C₃ are (P s , P₁), (P₁, P₂), (P₂, P₃), respectively, and that the end points of the straight lines L₁, L₂ are P₄, P₅..., and so on. In such case, the following data are fed into the three-dimensional curve generating apparatus 102 from the keyboard 101 and stored in the RAM 102a to specify the first curve CV₁: It should be noted that r i (i=1, 2, 3) denotes the arc radius of each circular arc, (x ci , y ci (i= 1, 2, 3) represent the coordinate values of the arc center of each circular arc, and (x i ,y i ) (i= 1, 2, 3) designate the positional coordinate values of the point P i . The second curve CV₂ obtained by the projection on the YZ plane is similarly entered from the keyboard 101 upon being approximated by circular arcs and straight lines. Such will complete processing for entry of the projection curve data. Note that the block in the flowchart corresponding to the above process is marked at its upper right-hand corner by the symbols (a)-1. The same will hold for the other blocks as well. (a)-2 A partitioning pitch s is entered from the keyboard 101 following entry of the first and second curve data. (b) Partition point processing (b)-1 When the first and second curve data and the partitioning pitch have been entered, the processor 102b, on the basis of a control program stored in the ROM 102c, finds the length D i of each element of the first curve CV₁ (where the line segments L₁, L₂,... and circular arcs C₁, C₂, C₃... constructing the first curve are assumed to be the elements), calculates the total of these lengths and stores the total length D t of the first curve in the working memory 102d. (b)-2 Thereafter, a number M of partitions is found from the length D t and partitioning pitch s by using the following equation: D t /s → M (1) It should be noted that M is an integer obtained by raising D t /s from the decimal point onward to arrive at the next higher whole number. (b)-3 The processor 102b then performs the operation 0 → i to initialize i. Note that the maximum value of i is (M-1). (b)-4 The processor also finds m, n in accordance with the following expressions: i + 1 → m, M - m → n (b)-5 Next, the processor 102b obtains the coordinate values (a i ,b i ) of the partition point P i which partitions the first curve into the ratio m:n. Specifically, the processor first calculates a length D' from the starting point P s to the partition point P i which partitions the first curve CV₁ into the ratio m:n, the calculation being performed in accordance with the following equation: Next, an element which includes a position distanced by the length D' from the starting point Ps is extracted. To extract this element, let D₁ be the length of the initial element, D₂ the length of the next element, and so on through D₃,..., D i ,... in like fashion. The element may then be extracted by finding k in the following expression: When the k-th element has been found, the processor finds the coordinate values (a i ,b i) of the point P i on the k-th element whose distance from the starting point thereof is D'', where D'' is found from: The obtained point is that which partitions the given curve into the ratio m:n from one end thereof. It will be assumed that when k = 1. (c) Processing for calculating of coordinate values of Q i The process is as follows for calculating the coordinate values (b i ,c i ) of the point Q i on the second curve CV₂ corresponding to the partition point P i on the first curve CV₁: Of the coordinate values (a i ,b i ) of the partition point P i , we assume that b i is the coordinate value on the Y axis, which is the common axis. We then find an element which constitutes the second curve CV₂ and which includes a point the Y-axis coordinate value whereof is b i . Letting a function specifying the element found in this manner be expressed by the following: f(y, z) = 0 (5) we substitute b i for y and find the Z-axis coordinate value z from the following: f(b i , z) = 0 Letting the Z-axis coordinate value obtained be c i , (b i ,c i ) will be the coordinate values of the point Q i on the second curve and corresponding to the partition point P i . (d) Processing for specifying three-dimensional curve (d)-1 (a i ,b i ,c i ) obtained in step (c) are stored in the data memory 102e as coordinate values of the point R i on the three-dimensional curve. (d)-2 The processor 102b then checks whether i=(M-1) holds. If it does not, processing from step (b)-4 onward is repeated. If i=(m-1) does hold, however, then processing for specifying the three-dimensional curve ends. It should be noted that a three-dimensional curve can be specified with greater precision if the partitioning pitch s is reduced to increase the number of partition points. When the position data (a i ,b i ,c i ) indicative of point R i and stored in the data memory 102e are transferred to the curved surface generating unit 103, the latter executes curved surface generation processing. As described hereinabove, the present invention includes entering data specifying first and second curves obtained by projecting a three-dimensional curve onto two adjacent planes in a rectangular coordinate system, partitioning the first curve into a number of line segments and finding coordinate values (a i ,b i ) of an i-th (i=1, 2, 3...) partition point P i , finding coordinate values (b i ,c i ) of a point on the second curve having a coordinate value b i on a common axis among the coordinate axes of the two adjacent planes, and specifying the three-dimensional curve by three-dimensional coordinate values (a i , b i , c i ) (i=1, 2, 3...). This makes it possible to specify a three-dimensional curve in a simple manner as well as a three-dimensional curved surface in which the three-dimensional curve serves as a reference curve. Industrial Applicability The method of specifying a three dimensional curve according to the present invention is advantageous when used in specifying a three-dimensional free curved surface and is therefore well-suited for application in the creation of an NC tape for machining a three-dimensional curved body.

Claims: A numerical control method comprising specifying a three-dimensional curve of an article to be machined, by the steps of entering data specifying first and second curves, in two mutually orthogonal planes in a rectangular coordinate system, which first and second curves are the projections of the three-dimensional curve in these two planes, finding coordinate values a i ,b i of an i-th (i=1, 2...) partition point P i from among partition points partitioning the first curve into a number of line segments, finding coordinate values b i ,c i of a point Q i on the second curve having a coordinate value b i on the coordinate axis common to said two planes, and specifying the three-dimensional curve by the three-dimensional coordinate values a i , b i , c i (i=1, 2,...). A numerical control method comprising specifying a three-dimensional curve according to claim 1, characterized by specifying said first and second curves upon approximating each by straight line segments and circular arcs. A numerical control method comprising specifying a three-dimensional curve according to claim 1 or 2, characterized by entering a partitioning pitch s, finding a total length D t of said first curve, and calculating a number M of partitions from D t /s. A numerical control method comprising specifying a three-dimensional curve according to any preceding claim, characterized by taking as an i-th partition point a point which partitions the total length of the first curve into a ratio m:n (where m=i+1, n=M-m). A numerical control method comprising specifying a three-dimensional curve according to any preceding claim, characterized in that said two mutually orthogonal planes are an X-Y plane and a Y-Z plane, the first curve is the projection of the three-dimensional curve onto the X-Y plane, and the second curve is the projection of the three-dimensional curve onto the Y-Z plane. A numerical control method comprising specifying a three-dimensional curve according to any preceding claim, characterized by finding an element of the second curve having said coordinate value b i , where it is assumed that a coordinate value on the axis common to the two planes is b i of the coordinate values a i ,b i of said partition point P i , obtaining a function specifying said element, and finding the other coordinate value c i of the point Q on said second curve upon substituting b i into said function.

Inventors: KISHI, HAJIMU, SEKI, MASAKI
Applicants: FANUC LTD.
Application year: 1984
Main classification: G05B19
IPC codes: G05B19, G06F17, B23Q15