JPH07104699B2 - Area processing method - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a region machining method for a numerically controlled machine tool, and in particular, it is sandwiched between a contour curve and at least two closed curves existing inside the contour curve. The present invention relates to an area processing method for processing an opened area.

[Prior Art] Generally, as numerical control processing, there are processing of hollowing out a predetermined depth inside a region surrounded by an outline curve (OLC) consisting of straight lines and circular arcs, and carving the inside of the region. In such machining, as shown in (a) of the explanatory view showing the conventional area machining method of FIG. 13, the (i-1) th cutting passage (PTi-1) is formed in one direction (solid arrow direction). After cutting is completed, the tool is raised by a predetermined amount, and then the tool is moved in the direction of the dotted arrow to the next (i) -th cutting path (PT).
Position the tool just above the machining start point (Ps) in i), then lower the tool to the machining start point (Ps), and along the (i) th cutting path (PTi) in the direction of the solid arrow. Is carried out to move, and thereafter, a region processing method for repeating cutting in the same direction is carried out.

Further, as another area processing method, as shown in FIG. 13 (b), after cutting along the (i-1) th cutting passage (PTi-1) is completed, the processing is started from the processing end point (Pe) to the next. Move the tool to the machining start point (Ps) of the (i) th cutting passage (PTi) of
Then, along the (i) th cutting passage (PTi),
A region processing method of performing reciprocal cutting in the direction of the arrow is also implemented.

By the way, an explanatory view showing the conventional processing area in FIG. 14 and
As shown in the explanatory diagram of the operation showing the processing method of the region shown in FIG. 14 of FIG. 15, the outline curve (OLC) and the outline curve (O
In some cases, it is required to process the area (AR; shaded area) sandwiched by the closed curve (INC) inside LC).

For example, a region surrounded by a closed curve (INC) (hereinafter, island (I
RD)) to form bolt holes for connection with other parts, or to use islands (IRD) with another tool for area (A
R) This is the case when it is necessary to penetrate deeper.

Here, as shown in the explanatory view showing the offset curve shape of the conventional area processing method of FIG. 16, two island portions (IRD1) and (IRD2) exist close to each other inside the outline curve (OLC). The closed curve (IN that specifies each island (IRD1), (IRD2)
If the offset curve shapes (INF1) and (INF2) obtained by offsetting C1) and (INC2) by a predetermined amount (for example, the value obtained by adding the tool radius "ra" and the finishing allowance "t") intersect, Take such a method.

FIG. 17 is an explanatory diagram showing a conventional area method of the offset curve shape shown in FIG.

The processing method for processing the shaded area (AR) between the outline curve (OLC) and at least two closed curves (INC1) and (INC2) existing inside the outline curve (OLC) is as follows. Offset curve shape (INF1) offset from (INC1), (INC2) to the outside according to the tool diameter "ra",
(INF2) step, offset curve shape (INF
1), a step of determining whether (INF2) intersects each other,
When the offset curve shapes (INF1) and (INF2) intersect, the common area (CSA) of the area surrounded by the intersecting first offset curve shape (INF1) and the area surrounded by the second offset curve shape (IRD2) Step of obtaining a combined offset curve formation (COFC) formed by removing the first and second offset curve shapes (INF1 ′) and (INF2 ′) forming the tool, the tool center is inside the combined offset curve formation (COFC) They are processed by the step of processing the area so that it does not enter.

FIG. 18 is an overall configuration diagram showing a numerical controller for implementing the conventional area processing method disclosed in, for example, Japanese Patent Laid-Open No. 60-127952. Also, FIGS. 19 and 20 are flowcharts showing a conventional area processing method.

In the figure, (101) is a control panel, (102) is a central processing circuit (CPU), (103) is a numerical control (NC) data reader,
(104) is a numerical control tape, (105) is a central processing circuit (10
ROM containing system programs for controlling 2) to perform various processes, (106) data input / output device, (107) machine tool, (108) pulse distributor, (10)
9X), (109Y), and (109Z) are X-axis, Y-axis, and Z-axis servo circuits (110X), (110Y), and (110Z) are servo motors for each axis, (111), (112), ( 113) is a RAM memory that stores programs and is used for work.

Hereinafter, a conventional area processing method will be described with reference to FIGS. 19 and 20.

When the cycle start button on the operation panel (101) is pressed in step 201, the central processing circuit (102) causes the numerical control data reading device (103) to operate the numerical control tape (1) in step 202.
Read one block of numerical control data from 04).
The numerical control tape (104) has data for area processing recorded in addition to normal passage data, G function command data, M-, S-, T-function command data, etc. At the end of the, M code "M02" indicating the program end is recorded. At the beginning of the area processing data, an area processing command indicating that the following data is area processing data is recorded, and at the end of the area processing data, a code indicating the end of the area processing data is recorded. It is recorded.

In step 203, the central processing unit (102) determines whether or not the numerical control data read by the control of the control program stored in the ROM (105) is "M02" indicating the program end, and "M02" If so, the numerical control process ends.

On the other hand, if the numerical control data read in step 204 is not “M02” indicating the program end, it is determined whether the numerical control data is a region machining command. If the numerical control data is not the area processing command, the central processing circuit (102) executes normal numerical control processing in step 205.
For example, if the numerical control data are M-, S-, T-function commands, these are sent to the machine tool (107) via a data input / output device (106) that functions as an interface circuit between the numerical control device and the machine. Output from the machine tool (107) to M
When a completion signal indicating the completion of processing for the-, S-, T-function instructions is generated, the numerical control data reading device (103) reads the next numerical control data.

If the numerical control data is passage data, the passage control processing described below is executed. That is, the incremental value “Xi, Yi, Zi” of each axis is obtained, and the speed component “Fx, F” in each axis direction is calculated from the incremental value and the command feed speed “F”.
y, Fz '' Then, a predetermined time ΔT seconds (=
The amount of movement "ΔX, ΔY,
ΔZ ”is obtained from the following formula ΔX = Fx · ΔT (2a) ΔY = Fy · ΔT (2b) ΔZ = Fz · ΔT (2c), and these“ ΔX, ΔY, ΔZ ”are obtained. Output to the pulse distributor (108) every time period ΔT seconds. The pulse distributor (108) performs simultaneous pulse distribution calculation of three axes based on the input data “ΔX, ΔY, ΔZ” to obtain the pulse “Xp, Y”.
p, Zp ”is generated, the distributed pulse is input to the servo circuits (109X), (109Y), (109Z) of each axis, and the servo motors (110X), (110Y), (110Z) are rotated. As a result, the tool is moved toward the target position relative to the work.

In addition, the central processing circuit (102) is arranged so that each axial direction current position “Xa, stored in the working memory (112) every ΔT seconds.
Ya, Za ”is updated by the following formula (the sign depends on the moving direction).

Xa ± ΔX → Xa ・ ・ ・ (3a) Ya ± ΔY → Ya ・ ・ ・ (3b) Za ± ΔZ → Za ・ ・ ・ (3c) Further, the central processing circuit (102) similarly has working memory every ΔT seconds. The remaining movement amount stored in (112) "Xr, Y
r, Zr (Initial values of Xr, Yr, Zr are incremental values Xi, Y
i, Zi) ”is updated by the following equation.

Xr−ΔX → Xr ・ ・ ・ (4a) Yr−ΔY → Yr ・ ・ ・ (4b) Zr−ΔZ → Zr ・ ・ ・ (4c) Then, the central processing circuit (102) has Xr = Yr = Zr = 0. .. (5) If the numerical control data reader (103),
Read the next numerical control data.

In the discrimination processing of step 204, if the numerical control data is the area processing command, the numerical control data reading device (103) reads the area processing data until the code indicating the end of the area processing data is read in step 206. And store in RAM (111).

The area processing data is the data that specifies the outline curve (OLC) of the area, the data that specifies the two closed curves (INC1) and (INC2) inside the outline curve, and the cutting direction data (the direction of the arrow A in Fig. 17 or Data indicating whether to cut by moving the tool in one of the D arrow directions), cutting direction data (B arrow direction or C in FIG. 17)
Data indicating whether the cutting passage (PTi) is to be shifted in the direction of the arrow), pitch amount in the cutting direction (shift value of cutting passage (PTi)) "L", cutting speed, cutting direction start point "Ps" , End of cutting direction “Pe”, position of approach plane, etc.

In the following, the cutting direction is the “−X” direction, the cutting direction is the “+ Y” direction, the approach plane is parallel to the “XY” plane, the height is “Za”, the cutting direction starting point “Ps” is “Xs, Ys”, The end point "Pe" in the cutting direction is "Xe, Ye".

When the reading of the area machining data is completed, the central processing circuit (102) adds the tool radius "ra" and the finishing allowance "t" from the contour curve (OLC) in step 208 to obtain a distance "D (= ra +
Offset curve shape (OFC) offset inward by "t)" and distance "D" from closed curves (INC1), (INC2)
Offset curve shape (INF
1) and (INF2) are calculated and stored in RAM (111). The distance "D" may be equal to the tool radius "ra". Further, the tool radius “ra” is obtained by reading the radius value corresponding to the command tool number from the offset memory (113) which stores the tool number and the tool radius corresponding to each other.

The offset curve shape (OFC) and the offset curve shapes (INF1) and (INF2) are obtained by the following processing.

That is, as shown in the explanatory view showing the process of obtaining the offset curve shape in the conventional area processing method of FIG.
Two straight lines that specify the outline curve (OLC) are (S1), (S
2), the straight lines (S1 ′) and (S2 ′) separated from the straight lines (S1) and (S2) by the distance “D” are obtained, and the intersection points (S1 ′) and (S2 ′) P2) is one of the points to specify the offset curve shape (OFC). Therefore, if the intersection points are similarly obtained and stored in the RAM (111), the offset curve shape (OFC) is obtained, and similarly the offset curve shapes (INF1) and (INF2) are obtained.

When the offset curve shape (OFC) and the offset curve shapes (INF1) and (INF2) are obtained, the central processing circuit (102) determines the offset curve shape data together with the data for specifying the contour curve and each closed curve in step 209. , To the display device (114).

Next, the central processing circuit (102) internally determines whether or not the offset curve shape (INF1) and the offset curve shape (INF2) intersect.

That is, the offset curve shapes (INF1) and (INF2) are
Since both are composed of a large number of straight lines and arcs (hereinafter, straight lines and arcs are called elements), as shown in the explanatory diagram showing the intersecting offset curve shapes in the conventional area processing method of FIG. (INF1) is composed of elements (E11), (E12) ... (E1n), and the offset curve shape (INF2) is elements (E21), (E22) ....... (E2
m).

Therefore, first, in step 210, “1 → i”, “1 → i”
Then, in step 211, it is determined whether the “i” th element “E1i” of the offset curve shape (INF1) intersects the “j” th element “E2j” of the offset curve shape (INF2). If they do not intersect, in step 212, “j + 1 →
In step 213, the size of “j” is compared with the number of elements “m” of the offset curve shape (INF2). And
If “j ≦ m”, the processing from step 211 onward is repeated. If “j> m” in the magnitude comparison in step 213, “1 → j, i + 1 → i” in step 214,
In step 215, the size of “i” and the number of elements “n” of the offset curve shape (INF1) are compared. And "i≤n"
If so, the processing from step 211 onward is repeated.

If “i> n” without crossing by the above processing, the central processing circuit (102) determines that the offset curve shape (INF
Judge that 1) and the offset curve shape (INF2) do not intersect.

On the other hand, in step 211, the element “E1i” is replaced by the element “E2
If it intersects with "j", the central processing circuit (102) determines that the offset curve shape (INF1) and the offset curve shape (INF2) intersect, and performs the following processing for generating a combined offset curve shape.

In step 216, elements "E11", "E12" ... "E1 (i-
1) ”is an element of the composite offset curve shape,
It is stored in the RAM (111) and the starting point "P" of the element "E1i"
"E1" from the intersection "Ci; see Fig. 21" above
i ′ ”is an element of the composite offset curve shape, and R
It is stored in AM (111) and is set to “i → 1” in step 217.
Then, in step 218, the elements "E11", "E12" ... "Ei"
Direction of tracing n ”and elements“ E21 ”,“ E22 ”……“ E2
Determine whether the direction following "m" is clockwise or counterclockwise. The direction data is given as area processing data. If both directions are clockwise or counterclockwise, the portion "E2j '" from the intersection "Ci" to the end point "Qj" of the element "E2j" is regarded as the element of the composite offset curve shape and the RAM (111 ) To remember. Note that if this direction is different, a combined offset curve shape can be generated in substantially the same manner as in the subsequent processing, and a description thereof will be omitted.

Next, the central processing unit (102), in step 219, reads “i +
1 → i, j + 1 → j ”. Then, in step 220, it is determined whether the element "E2j" of the offset curve shape (INF2) intersects with the element "E1i" of the offset curve shape (INF1). If they do not intersect, in step 221 “i + 1
→ i ”, and in step 222, the sizes of“ i ”and“ n ”are compared. If “i ≦ n” in step 222, step 2
Repeat the processing after 20. If “i> n” in step 222, the central processing unit (102) determines the element “E2
RAM as "j" is an element of the composite offset curve shape
(111), and at step 219, “i + 1 → i,
The process after step 220 is repeated as "j + 1 → j". If "j>m","1 → j" is set.

If the element "E2j" intersects the element "E1i" in the determination processing of step 220, the portion "E2j""from the starting point" Pi '"of the element" E2j "to the intersection"Ci'"and the intersection" The part “E1i ″” from the end point “Qi ′” of the element “E1i” to the element “E1i” and all the elements from the element “E1 (i + 1)” to the element “E1n” are RAM ( 111), and the process of generating the combined offset curve shape (COFC) is completed.

When the directions of tracing the respective components of the offset curve shapes (INF1) and (INF2) are different, if one of the components is rearranged in advance in the reverse order so as to be in the same direction as the other, the direction determination processing of step 218 Becomes unnecessary.

By the above processing, the first offset curve shape (INF1)
Area surrounded by and the second offset curve (INF2)
Forming a common area (CSA) surrounded by the first and second offset curve shape portions (INF1 ′) and (INF
2 ′) removed composite offset curve shape (COFC)
Is generated.

If the offset curve shape (INF1) and the offset curve shape (INF2) do not intersect, there is no area unworkable portion, so the central processing circuit (102) carries out area processing based on one direction or reciprocal cutting. In addition, hereinafter, it is assumed that the processing is performed by unidirectional cutting.

In step 225, "1 → k" is set, and the central processing circuit (102) is the k-th processing as shown in the explanatory view showing the processing when there is no portion intersecting the offset curve shape in the conventional area processing method of FIG. The process for specifying the second cutting path "PTk" is performed.

That is, in step 226, the straight line “SLk” is generated.

The straight line “SLk” is represented by the following equation y = Ys + p · k.

Thereafter, the central processing circuit (102), in step 227, intersects the straight line “SLk” with the offset curve shape (OFC) “Pk”,
"Qk" is calculated and the intersection points "Pk" and "Sk" of the straight line (SLk) and the offset curve shapes (INF1) and (INF2);
Find "Tk" and "Uk". Of the intersections “Pk” and “Qk”, the intersection having the larger X coordinate value is the machining start point, and the smaller one is the machining end point.

If the intersections “Pk” and “Tk” do not exist, the intersections “Sk” and “Uk” also do not exist. Then, step 228
In the same way as step 205, the tool is moved from the machining start point "Pk" to the machining end point "Qk" by cutting feed, and cutting is performed along the kth cutting path "PTk". . If only one of the intersection "Pk" or the intersection "Tk" exists (assuming that only "Rk" exists),
The central processing circuit (102) moves the tool from the machining start point “Pk” to the “Pk” point by cutting feed, and after the tool reaches the “Rk” point, the fast-forward tool reaches the approach plane in the + Z axis direction. After pulling up and reaching the approach plane, move the tool on the approach plane just above the "Sk" point by fast-forwarding, then move the tool by cutting feed to the "Sk" point, and then from the "Sk" point. It is moved by cutting feed to the machining end point "Qk", and cutting is performed along the kth cutting path "PTk".

If both the intersection points "Pk" and "Tk" exist, the tool is not moved from the "Sk" point to the machining end point "Qk" but is moved to the intersection "Tk" point by cutting feed, then "Tk" After the tool reaches the point, it is fast-forwarded to pull the tool in the + Z-axis direction to the approach plane, and after reaching the approach plane, the tool is moved fast-forward to just above the "Uk" point on the approach plane, and then the tool Then, it is moved down to the "Uk" point and then moved from the "Uk" point to the machining end point "Qk" by cutting feed to perform cutting along the k-th cutting path "PTk".

If the cutting along the cutting path "PTk" is completed, step 2
At 29, a difference ΔY (= Ye−Ya) between the current position coordinate value in the Y-axis direction (Ya; stored in the working memory (112)) and the cutting direction end point Ye is obtained, and the difference is larger than the pitch amount L. Determine the inside. If ΔY ≧ L, the central processing circuit (102) performs the operation “k + 1 → k” and repeats the processing from step 226.

On the other hand, if ΔY <L, the central processing circuit (102) moves the tool by cutting feed along the offset curve shape (OFC), offset curve shapes (INF1), (INF2) in step 231. The uncut portion is processed, and the area processing is completed.

Then, the next numerical control data is read and the above process is repeated.

On the other hand, when the offset curve shapes (INF1) and (INF2) intersect, as described above, the intersection of the straight line (SLK) and the offset curve shape (OFC), the straight line (SLK) and the combined offset curve shape (COFC) ), And using the coordinate values of each of these intersections, the cutting passage (PTk) is cut in the same manner as the routine from step 255 above to perform area processing.

[Problems to be Solved by the Invention] Since the conventional area processing method is configured as described above, the intersecting portions of the offset curve shapes (INF1) and (INF2) are not located at one location, but are shown in FIG. Even if there are areas to be cut inside the offset curve shapes (INF1) and (INF2), there is a possibility that they will be left uncut as shown in the explanatory diagram when there are multiple intersections of the offset curve shapes. was there.

Therefore, the present invention is a case where two or more island portions exist close to each other inside an outline curve and the offset curve shapes of the closed curves that specify the island portions intersect each other, and the offset curve shapes are plural. Even if they cross
An object of the present invention is to provide an area processing method in which there is no area to be left unmachined and all machinable areas can be processed.

[Means for Solving the Problem] A region processing method according to the present invention is a region processing method for processing a region sandwiched between an outer shape and at least two closed curve shapes existing inside the outer shape. ,
It is determined whether or not the offset curve shapes offset from the closed curve shapes by an amount corresponding to the tool diameter to the outside are obtained, the rotation defining directions of the offset curve shapes are aligned, and the offset curve shapes intersect each other. If the intersection calculation step and the above offset curve shapes intersect each other, the step of rearranging a plurality of intersecting intersections and whether the start point of the block having the intersection point to the intersection point is inside or outside the first offset curve shape And an area surrounded by the first offset curve shape that intersects according to the rearranged intersection point and the second offset curve shape by determining whether the end point of the block having the intersection point from the intersection point is inside or outside the second offset curve shape. And an OR processing step for obtaining a combined offset curve shape forming a common area of the area surrounded by And performs area processed along a forming offset curved shape.

[Operation] In the region processing method according to the present invention, whether the area from the start point of the block having the intersection to the intersection is inside or outside the first offset curve shape, and the end point of the block having the intersection point is the inside of the second offset curve shape. Or processing to determine a composite offset curve shape that forms a common area of the area surrounded by the first offset curve shape and the area surrounded by the second offset curve shape that intersect with each other according to the rearranged intersection. When there are a plurality of combined offset curve shapes obtained by the OR processing, the cutting processing area can be entirely cut by performing the area processing along all the combined offset curve shapes.

[Examples] Examples of the present invention will be described below.

FIG. 1 is an explanatory view showing a shape in which a machining region for a region machining method according to an embodiment of the present invention is offset by a radius of a tool, and FIG. 2 is the above-mentioned first embodiment according to an embodiment of the present invention. It is explanatory drawing which shows the shape which carried out the OR process of the shape of FIG. Since the numerical control device for realizing the embodiment of the present invention is the same as the conventional one shown in FIG. 18, its explanation is omitted here.

Next, the operation and operation of the embodiment of the present invention will be described.

First, among the operations that are the premise of this embodiment, the offset curve shape (INF1) and the offset curve shape (INF
Operation up to 2) (Step 2 in FIG. 19 of the conventional example)
(Corresponding to the operation up to 08) is the same as the above-mentioned conventional example, and therefore its explanation is omitted here.

Next, the operation of the main part of the embodiment of the present invention will be described.

In FIG. 1, (OLC1) is a curved shape in which the outer curved shape is offset inward by the tool radius, and (INF1),
(INF2) is an offset curve shape obtained by offsetting the inside curve shape to the outside by the tool radius. Here, if the center of the cutting tool is controlled within the shaded area in the figure, machining can be performed without overcutting the final shape.

Now, it is defined that the offset curve shape (OLC1), the offset curve shapes (INF1), (INF2), etc. all represent the inside of the closed area, and the processing for them is the OR processing, that is, at least the two areas. When the process of creating one of the areas is defined, the machinable area is the area inside the offset curve shape (OLC1) as shown in Fig. 2, and the offset curve shapes (INF1), (IN
Since it is the area outside of F2), if it is cut by the conventional method, it will be possible to cut without leaving uncut residue (see Fig. 2). That is, the offset curve shape (INF
1), (INF2) OR shape (composite offset curve shape (C
If the OFC) can be created, all processable areas can be processed.

Next, a procedure for creating such an OR shape will be described.

FIG. 3 is an explanatory view showing the outline of the OR processing in the area processing method according to the embodiment of the present invention.

The graphic (A) is called a body (BODY), and the graphic (B) is called a primitive. If the intersections of the two figures (A) and (B) are "P1" and "P2", the OR shape of the two figures becomes the figure surrounded by the thick line in FIG. Assuming that the definition direction of the two figures (A) and (B) is (CW), the two figures (A) and (B) are
It is divided into the following two subelements by the intersection points "P1" and "P2".

If a point on the arc (figure A) is outside the figure B and "Sa" and a point on the quadrangle (figure B) is outside the figure A is "Sb", The OR figure shown in FIG. 3 is an arc which is a subelement of the figure (A) existing outside the figure (B). And the straight line of the subelement of the figure (B) existing outside the figure (A) Can be determined from The intersection of two figures divides each figure into subelements. Then, an OR-shaped boundary curve is formed from the divided partial elements. It can be seen that all the intersections are points of the OR shape diagram that should be obtained.

Focus on the intersection and try another way of looking. Consider the point that moves in the (CW) direction from the starting point "Sa" of the body. "Sa" →
Considering up to "P1", arc It is an external element of the figure (B) and serves as a boundary line of the OR figure. The point above the figure (A) from the point "P1" goes out of the figure (A). That is, the boundary line of the OR graphic changes from the graphic (A) to the graphic (B) at the intersection. Therefore, this intersection is a figure (A) to a figure (B) or a figure (B) when considering the boundary line of the OR figure.
Is a state change point that changes from the element to the element of the figure (A).

Therefore, in order for the trajectory of the moving point "P" to become the boundary curve of the OR graphic, it must move to the subelement of the graphic (B) at the intersection "P1". If you move from the point "P1" to the figure (B) and then move the figure (B) in the (CW) direction, "S"
Then go to point "P2" via "b". The point on the figure (B) beyond the point “P2” goes out of the figure (B).
That is, since it is a state change point, the moving point "P" is
It moves to the figure (A) at the boundary of "P2", advances on the figure (A) in the (CW) direction, and returns to the starting point "Sa". The locus of the moving point "P" from the start point "Sa" to returning to "Sa" again becomes the boundary line of the OR graphic.

FIG. 4 is a flow chart showing the outline of the OR processing in the area processing method according to the embodiment of the present invention.

First, in step 1, in order to simplify the processing, the rotation definition directions of the figures (A) and (B) are aligned. Then, in step 2, all the intersections of the two figures are obtained, and the order of the intersections is rearranged from the start point to the end point of the body (A).
As a result, an intersection point sequence {Sa, P1, P2, ..., Pn, Sa} (i = 1,2, ..., n) is created from the intersection point group obtained and the starting point “Sa” of the figure (A).

In step 3, starting from the starting point of body (A), the OR of two figures is determined in the order of Sa → P1 → P2 → …… → Pn → Sa. In this case, if the arbitrary "Pi" and "Pi + 1" elements are the subelements of the figure (A) included in the figure (B), the elements of the figure (A) are included, and otherwise, the figure (A) is included. The element of B) is a subelement of the OR boundary curve.

When “i → i + 1” is set in step 4 and “Sa” points are checked, the process ends. If not, the process returns to step 3.

Next, this operation will be described in detail with reference to FIGS.

5 to 7 are explanatory views showing the structure on the memory of the area processing method according to the embodiment of the present invention.

Each element defined by a straight line or a circular arc having a defined shape is called a block. On the contrary, one shape is composed of several blocks.

FIG. 5 shows how blocks are arranged in the memory.

The block string showing the figure (A) is placed in a certain area on the memory, and the block string showing the figure (B) is placed in another area on the memory.

From these two block sequences, a plurality of OR shapes are created in another area on the memory according to the processing described later.

However, only one block row from the block row of the OR shape 1 to the block row of the OR shape n is an OFF shape including all closed shapes (original OR shape), that is, (COFC) in FIG. Yes, all the other block sequences are the closed shapes included in the OR-shaped block sequence, that is, the second block sequence.
In the figure, it becomes (COFC1).

In this judgment, if the OR shape sequence including all is a block sequence of the OR shape m, I) minimum value in the X direction of the block sequence of the OR shape m ≧ minimum value in the X direction of the other block sequences II) block of the OR shape m Maximum value in X direction of row ≥ Maximum value in X direction of other block rows III) Minimum value in Y direction of block row of OR shape m ≥ Minimum value in Y direction of other block row IV) Y of block row in OR shape m Maximum value in direction ≧ maximum value in Y direction of other block rows The block row satisfying the four conditions equal to or more than the above is an OR shape including all, so it is easy to specify this block row from a plurality of block rows.

FIG. 6 shows the structure of a block representing one element.

The mode part indicates the shape of the element and whether or not it is the last block in the block row as shown below. In addition, x, y indicates the coordinate value of the end point of the element, and e1, e2, e3 indicate the equation of the shape depending on whether the shape by bits 0,1 of the mode part is a straight line or an arc, as shown in FIG. The coefficient to represent is shown.

Further, FIG. 8 is an explanatory view showing an original figure for the area processing method of the embodiment of the present invention, and FIG. 9 is a description of a memory for storing the figure of the area processing method of the embodiment of the present invention. FIG. 10 does not show the setting of the intersection information of the shapes of the two figures of the area processing method of the embodiment of the present invention to the status, and FIG. 11 shows the two figures of the area processing method of the embodiment of the present invention. It is explanatory drawing which shows the setting to the status of the information near the intersection of a shape. FIG. 12 is an explanatory view showing the shape before and after the OR processing of the area processing method according to the embodiment of the present invention.

As shown in the flow chart of FIG. 4, the OR shape creation processing mainly consists of the four items of processing: creation of an OR graphic to obtain check intersection information of the original graphic and creation of the created graphic.

Hereinafter, these four items will be described in detail.

Original figure check For the given two figures (for example, figure 8), check the following items.

(A) Check the number of elements (number of blocks) (Yes / No / MAX) (b) Check the rotation direction of the figure If it is not the (CW) direction, convert it to the (CW) direction.

Find intersection information For all intersecting blocks of a given figure,
Perform the intersection calculation to obtain the information of the next item. here,
As a method of expressing the intersection, the area of the block row having the structure shown in FIG. 9 is secured in the memory other than that shown in FIG.

(A) Obtain the intersection coordinates x and y.

(B) The index (index) of the elements (shape blocks) of the figures at the intersections is obtained.

(C) Obtain the status at the intersection.

The above status means that bits 0 and 1 of intersection information (sts)
As shown in Fig. 10, bits 15 to 8 are classified and set according to the state of two intersecting blocks, and
It is classified and set according to the state shown in Fig. 11.

The information of bits 0 and 1 of the status shown in FIG. 10 means that the NORMAL intersection point is set to "0" when the intersection of two line segments intersects the block end point immediately before and the midpoint of the block end point.
On the other hand, when the end point of the block of the figure (A) is on the straight line between the end point immediately before the block row of the figure (B) and the end point of the block, the end point of the figure (A) is set to "1. Or
In the opposite case, "2" is set, and when the end points of the two coincide with each other, "3" is set, and the corresponding bits 0 and 1 are set.

Then, as shown in the state of the intersection in FIG. 10, the state of the intersection is set in bit 0 and bit 1 of the status. Further, in the upper 8 bits of the status, the state of a straight line near the intersection as shown in FIG. 11 (a) is set as shown in FIG. 11 (b).

Here, bits 15 and 14 indicate whether the block end point immediately before the block having the intersection of the figure (B) to the intersection is outside or inside the figure (A), and bits 13 and 12 are from the intersection. It shows whether the end of the block of the figure (B) having the intersection is outside (bit 13) or inside (bit 12) of the figure (A).

Bits 11 to 8 are outside the figure (B) from the end point of the block before the block having the intersection point to the intersection point, and from the intersection point to the end point of the block having the intersection point, similarly to the above. Or inside.

Therefore, at the intersection P1 in FIG. 11 (a), the upper 8 bits of the status are as shown in FIG. 11 (c),
At the intersection P2 of FIG. 11 (a), the upper 8 bits of the status are as shown in FIG. 11 (d).

Creation of an OR graphic By performing the above OR processing based on the intersection point information obtained above, an OR graphic can be created as shown in FIG. Here, if certain intersection information (CRSPO) is used as an OR shape, bit 0 of the intersection flag (flg) of that intersection information is set to "1".

If a point on one shape is traced from a point outside the other shape and the procedure is returned to that point, one of the OR shapes is obtained.

Checking the created figure Here, check the intersection information block, and if bit 0 of the intersection flag (flg) of all intersection information is "1", the creation of all OR shapes is completed. But if
If there are still unused ones, repeat the above procedure again. When the bit 0 of the intersection flag (flg) of all the intersection information blocks becomes "1", all the OR shapes have been obtained.

Now, the procedure for obtaining the OR shape will be described below by taking the shape of FIG. 11 (a) as an example.

The figure (A) and the figure (B) are represented in the memory as shown in FIG. 11 (e).

Here, the first block A of figure (A) and figure (B)
E1, e2, and e3 of [0] and B [0] are the final blocks A, respectively.
The equation of the shape with [3], B [3] (in this case, the equation of the straight line) is entered.

When the intersection information is created from this, two intersections are obtained, so two intersection information blocks can be created, as shown in FIG. 11 (f).

After performing the above pre-processing, an OR shape is created.

First, the intersection information block is searched from the top for an intersection flag (flg) bit of which is "0". In this case, the intersection flag (flg) of the first block is "0". Then, when the status is examined, it is found that the block of the figure (A) enters from the outside of the figure (B) to the inside of the figure (B) at the intersection, and the figure (B) is inside the figure (A) at the intersection. You can see that it goes out from. Therefore,
It can be seen that the first intersection is the point where the figure (A) changes to the shape of the figure (B). Then, first, in the OR shape creation area, as shown in FIG. 11 (g), A [0], A [1]
To copy.

Then copy the block of A [2] after that,
After that, set the x, y values of that block in the intersection information table.
Rewrite with x, y. So this is the elem from PA1 to P1
This is because ent and the elements from PA1 to PA2 are equal, so avoiding the recalculation of elements.

After that, set the intersection flag (flg) of the first intersection information to "1".
And G2-ind of the intersection information block is [3]. Therefore, this time, the block of the shape of the figure (B) is
Output from [3].

Therefore, when searching for an intersection information block having an intersection flag (flg) of "0", a second intersection information block is found. Then, when the status is examined, it can be seen that at this intersection, the block sequence of B changes from the outside of the shape of the figure (A) to the inside, and the block sequence of A changes from the inside of the shape of the figure (B) to the outside. That is, it can be seen that this intersection is the transition point of the second OR shape. Then, when the g2-ind of this intersection information block is examined, it is "2". Therefore, B [3], B [0], and B [1] are sequentially copied to the OR shape creation area. After that, B [2] is copied and its x, y is rewritten with x, y of the intersection information block.

Then, the intersection flag (flg) of the intersection information block is set to "1". Then, since g1-ing is "3", tracing is started from the shape A [3] of the figure (A), but before that, an intersection information block having an intersection flag (flg) of "0" is searched for.
However, since the intersection detail report block with the intersection flag (flg) of "0" does not exist anymore, the A shape is copied and the OR shape is created. . This means that one of the OR shapes has been created.

In this case, since there is one OR shape, all the intersection information blocks have been used.

However, in the case where a plurality of OR shapes can be created, it returns to the point where the OR shape was started to be created before using all the intersection information blocks. At this time, one OR shape is completed there.

Then, the intersection information (sts) of the intersection information block that has not been used is outside the other party, that is, the bit pattern is "0".
Repeat the same procedure starting from the block with the shape index (g1-ind, g2-ind) towards 110 ".

The procedure for obtaining the OR shape is the same as the processing for obtaining the OR shape, with the position of the starting point being the point on one shape inside the other shape as the starting point. It becomes AND processing to find the common area, and if the definition rotation directions of both shapes are reversed and the starting point is the same as the OR shape, that is, if it starts from a point outside the other shape,
This is a process (DIFF process) that takes the difference between the two shapes.

Note that these processes can also be used in, for example, CAM.

[Effects of the Invention] As described above, according to the area machining method of the present invention, an offset curve shape that is offset from each closed curve shape by an amount corresponding to the tool diameter to the outside is obtained, and whether the offset curve shapes intersect each other. When it is determined whether or not the offset curve shapes intersect each other, a combined offset curve shape that forms a common area of the area surrounded by the intersecting first offset curve shape and the area surrounded by the second offset curve shape is intersected. The OR processing to be performed is performed on each of a plurality of intersecting portions, and the area processing is performed along all the combined offset curve shapes. All machinable areas can be machined so that all areas can be cut.

[Brief description of drawings]

FIG. 1 is an explanatory view showing a shape in which a machining region for a region machining method according to an embodiment of the present invention is offset by a radius of a tool, and FIG. 2 is the first embodiment according to an embodiment of the present invention.
FIG. 3 is an explanatory view showing an OR-processed shape of the figure, FIG. 3 is an explanatory view showing an outline of the OR processing in the area processing method of one embodiment of the present invention, and FIG. 4 is an area of one embodiment of the present invention. FIG. 5 to FIG. 7 are flowcharts showing the outline of the OR processing in the processing method, FIG. 5 to FIG. 7 are explanatory views showing the structure on the memory of the area processing method of one embodiment of the present invention, and FIG. FIG. 9 is an explanatory view showing an original figure for the area processing method, FIG. 9 is an explanatory view of a memory for storing the figure of the area processing method in one embodiment of the present invention, and FIG. 10 is an area processing of one embodiment of the present invention. FIG. 11 is an explanatory diagram showing the setting of the intersection information of the shapes of the two figures of the method to the status; FIG. 11 is an explanatory diagram showing the setting of the shape information of the two figures of the area processing method of the embodiment of the present invention; FIG. 12 shows an area processing method according to an embodiment of the present invention. (A) Explanatory drawing showing the shape before and after processing, FIG. 13 is an explanatory drawing showing a conventional area processing method, FIG. 14 is an explanatory drawing showing a conventional processing area, and FIG. 15 is processing of the area shown in FIG. 14 above. FIG. 16 is an explanatory view of the operation showing the method, FIG. 16 is an explanatory view showing the offset curve shape of the conventional area processing method
FIG. 17 is an explanatory view showing a conventional area processing method of the offset curve shape shown in FIG. 16, and FIG. 18 is an overall configuration showing a numerical controller for realizing the area processing method of one embodiment of the present invention and the conventional example. FIG. 19, FIG. 19 and FIG. 20 are flowcharts showing a conventional area processing method, and FIG. 21 is an explanatory view showing processing for obtaining an offset curve shape in the conventional area processing method,
22 is an explanatory view showing an intersecting offset curve shape in the conventional area processing method, FIG. 23 is an explanatory view showing a process when there is no portion intersecting the offset curve shape in the conventional area processing method, FIG. 24 FIG. 6 is an explanatory diagram showing a case where there are a plurality of intersections of offset curve shapes in the conventional area processing method. In the figure, OLC ... Outer shape, INC ... Closed curve shape, INF, OFC ... Offset curve shape, COFC ... Combined offset curve shape, P ... Intersection. In the drawings, the same reference numerals and symbols indicate the same or corresponding parts.

Claims (1)

[Claims] 1. A region machining method for machining a region sandwiched between an outer shape and at least two closed curve shapes existing inside the outer shape, the method being based on a tool diameter from each of the closed curve shapes to the outside thereof. The offset curve shape that is offset by a certain amount, the step of aligning the rotation definition directions of the offset curve shape, the step of calculating an intersection point for determining whether the offset curve shapes intersect each other, and the offset curve shapes When intersecting, the step of rearranging a plurality of intersecting intersections, whether the start point of the block having the intersection point to the intersection point is the inside or outside of the first offset curve shape, and the end point of the block having the intersection point is the second point The inside or outside of the offset curve shape of the
An OR processing step of obtaining a combined offset curve shape that forms a common area of the area surrounded by the offset curve shape and the area surrounded by the second offset curve shape. A region processing method characterized by performing a region processing.