JPH0340108A - Nc data editing system - Google Patents

Abstract

PURPOSE:To facilitate an editing task by defining a position conversion matrix based on a position conversion command programmed into the original data and position-converting automatically a point defined in the original data based on the position conversion matrix before a conversion cancel command is read. CONSTITUTION:A position conversion command is previously programmed into the original data to prescribed the conversion process to be carried out in an NC data editing process. In this editing process, an automatic programming device reads successively the NC data to be used as the original data and defines a position conversion matrix based on the position conversion command programmed into the original data. Then the automatic programming device position-converts successively the positions of points defined in the original data based on the position conversion matrix in a period during which the position conversion command is read and then a conversion cancel command is read. Then both commands are preserved as the non-execution data for production of the editing data. As a result, the NC data can be quickly and accurately edited.

Description

[Detailed Description of the Invention] Industrial Application Field The present invention relates to an NC data editing method, particularly to an NC data editing method, which is the original data.
The present invention relates to an NC data editing method that automatically edits NC data by performing various conversion processes on C data and, if necessary, creates original data again from the edited NC data.

2. Description of the Related Art In general, when various types of editing are performed on previously created NC data, that is, original data, for example, to correct the positional deviation of the original data created using a digitizer or the arrangement of processed shapes. Edit the NC data for processing by correcting the position conversion, or perform mirror conversion on the original data to create a new N.
When editing C data, manually calculate the destination of the points defined in the original data according to the original data, the amount of positional deviation of the original data, the set position of the mirror, etc. The editing work is performed by resetting the destination value as NC data.

This type of method requires complicated manual calculations when editing NC data, which takes a lot of time, and also makes it easy for errors to occur during the manual calculation stage. The disadvantage is that the reliability of the NC data is low.

Therefore, in order to eliminate these drawbacks of the conventional technology, the present applicant has programmed in advance a position conversion command in the original data that defines the conversion process to be executed when editing NC data.
After the position transformation matrix is determined by an automatic programming device and the position transformation matrix is defined, the positions of the points defined in the original data are transformed using the above position transformation matrix until the transformation cancellation command is read, and the NC data is automatically converted. The NC data editing method has already been proposed in a patent application.

Problems to be Solved by the Invention This NC data editing method allows NC data to be edited quickly and accurately, but since the storage capacity of the automatic programming device is limited, it is difficult to convert the original data before editing and the position. As in the past, it is virtually impossible to save all edited data, and there are also problems such as the program numbers of the original data and edited data duplicating, so it is necessary to change the position after editing is completed. There are cases where it is necessary to save only the edited data and erase the memory of the original data.

On the other hand, in actual design work, there are cases where it is desired to position a figure defined by the original data, such as a machining path indicated by points defined in the original data, to another position based on the original data. However, if the memory of the original data is deleted and only the edited data is saved, in order to perform position conversion using the original data as a reference, the original data that serves as the reference must first be reproduced. To do this, it is necessary to keep a record of the position transformation related to the previous editing work, create a new position transformation that has the opposite effect to the previous position transformation, and apply the inverse transformation to the current edited data. , complex calculation work is required. Naturally, this inverse transformation must be performed only on the edited data that was subject to position transformation in the previous editing operation, and if the range of edited data that is subject to inverse transformation is set incorrectly, the normal original data cannot be played.

SUMMARY OF THE INVENTION Therefore, an object of the present invention is to provide an NC data editing method that can quickly and accurately edit NC data, and that can reliably reproduce the original data without wasting the storage capacity of an automatic programming device. It's about doing.

Means for Solving the Problems The NC data editing method of the present invention sequentially reads NC data as original data, defines a position transformation matrix based on a position transformation command programmed in the original data, and defines a position transformation matrix based on a position transformation command programmed in the original data. The period from when the command is read until the conversion cancellation command is read.
An NC data editing process that sequentially transforms the positions of points defined in the original data using the above-mentioned position transformation matrix, stores position transformation commands and conversion cancellation commands as non-execution data, and creates edited data, and an inverse transformation command is input. If so, read the edited data sequentially, calculate the inverse transformation matrix of the above position transformation matrix from the position transformation commands saved as non-execution data in the editing data, and cancel the conversion with the position transformation commands that were set as non-execution data. The above-mentioned problem has been solved by providing an original data creation step of sequentially inversely transforming points defined in the edited data with the command using the above-mentioned inverse transformation matrix, and converting the edited data into original data.

A position conversion command that defines the conversion process to be executed in the action NC data editing step is programmed in advance into the original data.

In the NC data editing process, the automatic programming device sequentially reads the original NC data, defines a position transformation matrix based on the position transformation command programmed in the original data, and cancels the transformation after the position transformation command is read. Until the commands are read, the positions of the points defined in the original data are sequentially transformed using the position transformation matrix, and the position transformation commands and transformation cancellation commands are saved as non-execution data to create edited data.

When an inverse transformation command is input and the original data creation process is started, the automatic programming device sequentially reads the edited data and performs the inverse transformation of the position transformation matrix from the position transformation command stored as non-executable data in the edited data. A matrix is obtained, and the points defined in the edited data between the position conversion command and the conversion cancellation command, which are set as non-executable data, are sequentially inversely transformed using the above-mentioned inverse transformation matrix, and the original data is reproduced.

Example Hereinafter, the present invention will be described in detail with reference to the drawings.

FIG. 3 is a block diagram showing the main parts of an automatic programming device according to an embodiment of the present invention, in which 1 is a processor (hereinafter referred to as CPU), and 2 is a control for controlling the automatic programming device. R where the program is stored
OM, 3 is a RAM having a storage area for storing the loaded system program and a storage area for storing the results of arithmetic processing by the CPU 1, 4 is an NC data storage memory for storing the loaded original data and edited data, 5 is a keyboard, 6 is a disk controller, and 7 is a graphic display (hereinafter referred to as CRT), and these elements 1 to 7 are connected by a bus 8.

FLI and FL2 are floppy disks that serve as external storage devices.The floppy disk FLI stores various system programs, and the floppy disk FL2
The original data, edited data, etc. that have already been created are saved. The above-mentioned floppy disk FLI contains various conventional programs for creating and modifying NC data, as well as programs for data conversion processing (see Figure 1) for implementing NC data editing processes, and original data creation processes. It is stored as a program (see FIG. 2) or a system program for the inverse conversion process to be performed.

An embodiment of this method will be described below with reference to flowcharts shown in FIG. T and FIG. 2 showing an overview of data conversion processing and inverse conversion processing.

When the automatic programming device is powered on and the floppy disk FLI is set in the disk controller 6, the CPU is driven according to the control program in the ROM2.
I displays an initial screen for selecting a system program on the display screen of the CRT 7.

Therefore, when editing new NC data by applying position conversion correction or mirror conversion to the original data created in advance, the operator first refers to the initial screen and selects the data to be used for the NC data editing process. Operate the key to select the conversion process, store the data conversion process program stored on the floppy disk FLI in the RAM 3, and set the program number of the original data to be edited on the CPUI via the keyboard 5. do. Note that if the original data to be edited is not stored in the NC data storage memory 4, the floppy disk FL2 storing the optical data is set in the disk controller 6.

The CPU, which has started processing according to the data conversion processing program stored in the RAM 3, reads the original data having the program number to be edited from the NC data storage memory 4 or the floppy disk FL2 based on the set program number, and stores it in the RAM 3. Store in.

The data conversion process in the NC data editing step will be described below, assuming that the original data as shown in Table 1 is stored in the RAM 3 as an editing target.

Table 11 Original data Table 2 Edit data In the table ↑ showing an example of original data, 012345 is the program number, and Gol is the conventional linear interpolation code, which is linear interpolation between two points on the X-Y-23 dimensional coordinate system. is defined and applied modally to the movement command block set in XY2. G98... is a position conversion command code provided for this embodiment, among which G98P
1 to G98P3 are
IJK any reference point programmed in the original data with
Define to move to the corresponding point set by, and
G981'0 defines mirror conversion using a mirror placed at the midpoint of any two points programmed in the original data in XY2 and IJK and perpendicular to the straight line connecting the two points in order to embody the conversion process. . G99 is a conversion cancellation command code provided for this embodiment, and has a function of canceling each position conversion matrix defined by the position conversion command code. Further, Table 2 is a table showing edited data obtained by performing data conversion processing on the original data shown in Table 1.

The CPUI that started the data conversion process first
Set the unit matrix E to , set O to index i and initialize (step 5101), read one block of original data stored in R, AM3 (step 5102),
Determine whether or not the 1-block data read this time is a block indicating the end of the original data (step S1
03). In the example shown in Table 1, first, 012345 indicating the program number is read, and since it is not a program number indicating the end of the original data, the process then moves to step 8104 to check whether it is a conversion command block or not. , G9B, but since it is not a conversion command block, step 5 is then performed.
The process moves to step 105, where it is determined whether or not it is a movement command block. Since it is not a movement command block, the process proceeds to step 8106 to determine whether it is a conversion command cancellation block, that is, whether or not it is a block with a conversion cancellation command code of G99. Since it is not a block, the one block of data read this time, that is, the program number 012345, is directly written into the RAM 3 as the edited data after data conversion processing is executed (step 5107, see Table 2).

In the next step, the CPU 1 reads the next block of original data stored in the RAM 3 (step 81.02),
It is determined whether one block of data read this time is a block indicating the end of the original data (step S10).
3). In the example z shown in Table 1, G98PIXxaYyaZZaliaJjaKk
Since a has been read and is not a block indicating the end of the original data, the process moves to step 5104, where it is determined whether it is a conversion command block, that is, whether it is a block with a position conversion command code of G98. be done. Since the block in question is a conversion command block having a position conversion command code of G98, the process moves to step 5108 to determine whether or not the command code of G98 in the block is modified with PO, that is, for mirror conversion. It is determined whether or not it is a position conversion command code. Since the position conversion command code of the block concerned is not modified with PO, the process moves to step 5101 and it is determined whether or not the position conversion command code of the block concerned is modified with P3. Since the position conversion command code is not modified with P3, the process moves to step S''-10 to specifically describe the conversion command block, that is, the position conversion command code G98Pl and the conversion process using the position conversion command code. The coordinates 1a of the first reference point, which is the data for
, R, 28, and the coordinates ia of the I-th corresponding point, which is the corresponding point to which the first reference point is to be moved.

After temporarily storing ia and ka in the register, and adding parentheses as a non-execution symbol to the data of the block to make the position conversion command non-execution data (step 811.1),
Data in the block that is considered non-executable data (G98
PIXxaYya2zaliaKka) is written into the RAM 3 as edit data (step S107; see Table 2).

Next, the CPU reads the next block of the original data stored in the RAM 3 (step 5102), and determines whether the block of data read this time is a block indicating the end of the original data (step 5102). Step 5103)
. In the example shown in Table 1, G98t'2XzbYybZ
zbliblibKkb is read, and since it is not a block indicating the end of the original data, the process moves to step 5104 to determine whether it is a conversion command block, that is, G98.
It is determined whether the block has the position conversion command code. Since the block is a conversion command block having a position conversion command code of G98, step 51
085, it is determined whether or not the position conversion command code of G98 in the block is modified with PO. Since the command code of the block is not modified with PO and is not a position conversion command code for mirror conversion, the process moves to step 5109, where the position conversion command code of the block is modified with P3. However, since the command code of the block concerned is not modified with P3, the process moves to step 5110, and the command code of the relevant block, that is, the position transformation command code G98, is transferred to step 5110.
P2 and the coordinate xb of the second reference point, which is data for embodying the position conversion process using the position conversion command code code.
, yb, zb, and the coordinates ib, ib, kb of the second corresponding point, which is the corresponding point to which the second reference point is to be moved, are temporarily stored in a register, and parentheses are added to the data of the block as non-execution symbols. After making the position conversion command into non-executable data by attaching the
xbYyb2zblibljbKkb) is written into the RAM 3 as edit data (step S107. See Table 2).

Next, the CPU reads the next two blocks of the original data stored in the RAM 3 (step 5102), and determines whether the one block of data read this time is a block indicating the end of the original data (step 5102). Step 5102).

In the example shown in Table 1, G98P3XxcYyc2zc
licJjcKkc is read and step 5103,5
From i04, 5108, the process moves to step 5109, and it is determined whether or not the position conversion command code of the block is modified with P3. The position conversion command command code of the block is modified with P3, which is 1
This means that all the various data for defining the two position transformation matrices have been read and stored. Therefore, C.P.
The UI moves to step 5112 and stores the data stored in each register in the previous processing, that is, G98PIXx.
aYya2zalialjaKka and G98P2Xx
bYybzxbliblibKkb, and one block of conversion command block G98P3Xxc read this time
A position transformation matrix Ma is calculated based on YyczzclicljcKkc.

That is, in the process of step 5112, the first reference points xa, ya, and za programmed in the original data are moved to the first corresponding points ia, ja, and ka, and the second reference points xb,
yb.

Move xb to the second corresponding points ib, ib, kb,
And the third reference points xc, yc, 2C are the third corresponding point i
Position transformation matrix M for moving to c, jc, kc
a is defined.

FIG. 4 is a conceptual diagram briefly explaining the action of the position transformation matrix Ma, which transforms the three reference points on the X-Yz three-dimensional coordinate system into three corresponding points. A position transformation matrix that moves in a pair-to-one correspondence, and is uniquely defined by parallel and rotational movements that indicate the positional relationship between a reference point and a corresponding point. Therefore, the above X-Y-2
NC data indicating an arbitrary point on a three-dimensional coordinate system"+ V+
The relationship between z and the moving points xI, YI, zl obtained by multiplying the arbitrary point by the position transformation matrix Ma is the same as the relationship between the reference point and the corresponding point.

The CPU that has defined the position transformation matrix Ma in this way stores the position transformation matrix Ma in the memory M indicated by the index j.
i, i.e., stored in the memory MO (step 5113),
The matrix obtained by multiplying the matrix of the memory M by the position transformation matrix of the memory MO is stored again in the memory M (step 5114), and the index l
The value of is incremented to secure a memory Mi for storing the position transformation matrix defined next (step S1↓
). Since the initial value of memory M is the unit matrix E, currently,
The memory M stores the position transformation matrix Ma. Next, after adding parentheses as a non-execution symbol to the conversion command block of one block read this time to make the position conversion command non-execution data (step 5ill), the data of the block that was set as non-execution data ( G98P3XxcYy
c4xc! 1cJjcKkc) as editing data
Write to M3 (step S107. See Table 2).

Next, the CPU reads the next block of the original data stored in the RAM 3 (step 5102), and determines whether the block of data read this time is a block indicating the end of the original data (step 5102). Step 8103)
. In the example shown in Table 1, G98POXxdYydzx
Since dlidljdKkd is read and is not a block indicating the end of the original data, the process moves to step 5104 at step 9 to determine whether it is a conversion command block, that is, whether it is a block with a position conversion command code of G98. It is determined whether The block is G9
Since this is a conversion command block having a position conversion command code of G98 in the block, the process moves to step S108 to determine whether or not the position conversion command code of G98 in the block is modified with PO, that is, for mirror conversion. It is determined whether or not it is a position conversion command code. Since the position conversion command code of the block is a code for mirror conversion with the PO modification, the CPU 1 executes step S1
, and the conversion command block read this time, G98P.
Based on OXxdYydZzdlidjjdKkd,
One position transformation matrix Mb for mirror transformation is calculated.

That is, in the process of step 311.6, arbitrary two points xd, yd, +d and id programmed in the original data.

A position transformation matrix Mb is defined by a mirror placed at the midpoint between jtl and kd and perpendicular to the straight line connecting the two points.

FIG. 5 is a conceptual diagram that briefly explains the action of the position transformation matrix Mb for mirror transformation. The mirror transformation is based on the plane π, which is placed at the midpoint between zd, id, jd, and kd and is perpendicular to the straight line connecting these two points. In the example shown in FIG.
#, Yl/, zl/ are points xl", Yl',
zl", and the point x2' + Y2', z2'
are converted to points X2', Y2'', d', and points x3' + Y3', z3' are points 3#.

It will be converted to Y3", z3". The position transformation matrix Mb is a position transformation matrix uniquely defined by the plane π.

The CPU that has defined the position transformation matrix Mb for mirror transformation in this way stores the position transformation matrix Mb in the memory Mj1, that is, the memory Ml indicated by the incremented index i (step 5117), and stores it in the matrix of the memory M. The matrix multiplied by the position transformation matrix of memory M1 is
In step 811.4), the value of the index l is incremented to secure memory for storing the position transformation matrix to be defined next (step S1↓5). Therefore, the memory M currently stores a position transformation matrix Ma and a position transformation matrix Mb.
The matrix multiplied by is stored, two position transformation matrices are defined simultaneously, and the value of index j is updated to 2. Next, after adding parentheses as a non-execution symbol to the conversion command block of the ↑ block read this time to make the position conversion command non-execution data (step 5114),
Data in the block that is considered non-executable data (G98
1'0Xx4Yyd2zdlidJjdKkd) is written into the RAM 3 as edit data (step 107, see Table 2).

Next, the CPU reads the next ↑ block of the original data stored in the RAM 3 (step 5102), and determines whether the one block of data read this time is a block indicating the end of the original data ( Step S103
). In the example shown in Table 1, G, 0IXxlYylZZ
l is read, and since it is not a block indicating the end of the original data, the process then moves to step 5104, where it is determined whether it is a conversion command block, that is, whether it is a block with a position conversion command code of G98. However, since it is not a conversion command block, the process then proceeds to step 107, where it is determined whether or not it is a movement command block.

Since the block in question is a movement command block, the process moves to step 5118, and points χI, yl defined in the original data by the 1-block read this time.

A positional transformation based on the transformation matrix M is performed on zl.

That is, CPUI is the point Xi defined by the original data.
, 71.21 is multiplied by the transformation matrix stored in the memory M to obtain the transformed positions xl", yl", zl". The transformation matrix stored in the memory M is the position transformation matrix M
Since it is a matrix obtained by multiplying a by the position transformation matrix Mb, the point
Two types of positional transformations will be executed simultaneously for I, yl, and zl. FIG. 6 is a diagram conceptually showing the position transformation performed by the current transformation matrix stored in the memory M, where the points XI, yl, 2+ are at the position of the point x1'yl' + Z17 by the position transformation matrix Ma. The position is transformed to , and the points XI', yl', 2+'
From the position of , the point xl", IN,
It will be converted to the position of zIN. However, CPU1
In this work, since the memory M stores in advance a matrix obtained by multiplying the position transformation matrix Ma by the position transformation matrix Mb for mirror transformation,
Points XI, yl defined in the original data.

Based on zl and the transformation matrix stored in the memory M, the transformed positions Xi", yl", Zl" are immediately calculated.

The CPU that performed position transformation on the points Xi, yl, and 21 defined by the original data of the block ■ that was read this time and calculated the transformed positions χ1", yl", and 21" is as follows:
The converted positions x1'', y1'', 21'' are written to the RAM 3 as editing data (step 31.07. See Table 2).

Next, the CPUI reads the next block of original data (step 5102), and similarly to the above, the process proceeds to step 510.
2-Step 5L03-Step 5104-Step 5
105-Step 5118 Executes the process of step 5107, and points X2. y2. z
2 and X3. y3. Post-conversion position x2 of Z3
, Y2", 22" and x3", Y3"23",
(Step 5118), calculate the RA as the edited data.
Write to M3 (step S107. See Table 4 2).

Next, the CPU 1 reads the next one block of the original data stored in the RAM 3 (step 5IO2), and determines whether the one block of data read this time is a block indicating the end of the original data ( Step 3103)
. In the example shown in the topsoil, 1 is a block in which G99 is read and does not indicate the end of the original data, so the process moves to step 5104 and checks whether it is a conversion command block, that is, the position conversion command code of G98. However, since it is not a conversion command block, the process then proceeds to step S'05, where it is determined whether it is a movement command block. Since it is not a movement command block, the process proceeds to step 5106, where it is determined whether it is a conversion command cancellation block, that is, whether it is a block having a conversion cancellation command code of G99. Since this block is a conversion command cancellation block with a conversion cancellation command code of G99, step 5
11-9, the transformation matrix stored in the memory M is the memory M (i-1,) indicated by the index I, that is, the current memory M1, which stores one position transformation matrix. The inverse matrix of the position transformation matrix stored in the memory of
Multiply by the inverse matrix of the position transformation matrix Mb for mirror transformation,
The resulting matrix is stored again in memory M. Therefore, the transformation matrix currently stored in memory M is M a * M
b * M b -' = Ma, which means that the position transformation matrix Mb for mirror transformation has been canceled,
Only the definition for position transformation by the position transformation matrix Ma is valid. Therefore, there is no need to store the position transformation matrix Mb for mirror transformation in the memory M1, and the CPU 1
decrements the value of index i to i=1 and reserves memory M1 as a memory for the position transformation matrix defined next (step 8.120).

Next, after adding parentheses as a non-execution symbol to the conversion command cancel block of one block read this time to make the conversion cancellation command code G99 non-execution data (step S1
．． ]1. ), the data (G99) of the block that has been set as non-executable data is written into the RAM 3 as edited data (step 107, see Table 2).

Next, the CPU reads the next block of original data stored in the RAM 3, that is, G99 (step 51).
03), in the same manner as above, after executing the determination processing of steps 5103-5104-step 5105-step 5106, the processing of step 5119 is executed again. That is, the CPUI selects the memory M(i-1) indicated by the index i in the transformation matrix stored in the memory M, that is,
The inverse matrix of the position transformation matrix stored in the latest memory which is currently the memory MO and stores one position transformation matrix;
That is, the position transformation matrix Ma is multiplied by an inverse matrix, and the obtained matrix is stored in the memory M again. Therefore, the transformation matrix currently stored in the memory M is Ma*Ma-''=E, which means that the position transformation matrix Ma is released following the position transformation matrix Mb for mirror transformation, and the The value of M becomes the unit matrix E and returns to the initial state.Therefore, there is no need to store the position transformation matrix Ma in the memory MO.
The CPU decrements the value of the index i to 7 i = 0, and reserves the memory MO as a memory for the position transformation matrix to be defined next (step S120
).

Thereafter, in the same manner as described above, the CPU sequentially reads the next block of the original data stored in the RAM 3 (step 107), and determines whether or not the block indicates the end of the original data. 5103), the read block is conversion command block G98... (step S104), and position conversion command code G98
P], G98P2.

If the block has G98P3, the first reference point and the first corresponding point, the second reference point and the second corresponding point, and
The third reference point and the third corresponding point are sequentially read and stored, the position transformation matrix Ma is calculated from the data of these points, and the position transformation is defined (Step 3112), and the position transformation command code for mirror transformation is If the block has G98PO, the position transformation matrix Mb for mirror transformation is calculated based on any two points set in the original data, and the mirror transformation is defined (step 8116).
By sequentially storing the R transformation matrix in a new memory Mi (step S113.Step 511-7), and re-storing the memory M whose initial value is the unit matrix E by multiplying it by the position transformation matrix defined above. , Regardless of the number and type of defined position transformation matrices, create and define a transformation matrix M equivalent to the composite of these position transformation matrices (step S 114), and increment the value of index i in step 5115. ), the original data of each block with the position conversion command code is added with parentheses as a non-execution symbol (
Step 5111), write to RAM3 as edit data (step 5107), and write GO indicating the movement command block.
At the stage when the command code of I is read (step 5105
), the definition point data of the original data following the command code GOI is multiplied by the transformation matrix M to perform position transformation.Step 5
118), and sequentially writes it to RAM3 as editing data (step 5107), while when the conversion command cancellation block is read, the conversion matrix M is multiplied by the inverse matrix of the memory M(i-1) that stores the latest conversion matrix. In order to cancel only the latest defined conversion matrix by re-storing it in the memory M, step S119) adds parentheses as a non-execution symbol to the conversion command cancel block having the conversion cancellation command code G99 ( Step 5111), write to RAM3 as edit data (Step 5107),
Furthermore, if the read one block of original data is not a conversion command block, a movement command block, or a conversion command cancellation block, the read one block of original data is directly written to the RAM 3 as editing data ( Step S106. Step 5107).

Finally, a block indicating the end of the original data, for example, a program end code such as "Mo2" is read, and the above data conversion process is performed on all blocks of the original data corresponding to the set program number. When executed, the CPUI considers that the editing work on the selected original data has been completed, and ends the data conversion process, which is the NC data editing process.

Therefore, according to the data conversion process of this embodiment, by programming the position conversion command codes G98PI to G98P3 and the reference points and corresponding points for embodying these position conversion command codes in the original data, it is possible to easily It is possible to define positional transformations in Position conversion command code G9 for mirror conversion
It is only necessary to program 8PQ and any two points to embody the position conversion command code, and no complicated arithmetic processing is required.

In addition, each time a position transformation command matrix is defined by a position transformation command code, the transformation matrix is defined by sequentially integrating these position transformation matrices, so regardless of the type or number of position transformations, automatic A programming device can easily perform desired positional transformations and edit MC data.

Table 3 is an example conceptually showing the relationship between the position conversion command code, conversion cancellation command code, and conversion matrix M. At the stage where the position conversion matrix is not defined by the position conversion command code, the initial value is E (unit: The original data A is directly edited data by the transformation matrix M, which is a matrix), and when the position transformation matrix MO is defined by the position transformation command, the transformation matrix M
The transformation matrix MO is multiplied by the transformation matrix MO (step 5114), and the transformation matrix M becomes MO. After the position transformation matrix MO is defined by the position transformation command, the original data B and C are position transformed by the transformation matrix M (M=MO), and the edited data are set as B-MO and C-MO. Then, after the position transformation matrix MO is defined, when the position transformation matrix Ml is defined by another position transformation command, the transformation matrix M (M=MO
) is multiplied by the position transformation matrix Ml (step S↑↑4)
, the transformation matrix M becomes MO-Ml, and the original data D and F after the position transformation command old is defined by the position transformation command.
is position-transformed by the transformation matrix M (M=MO・Ml), and the edited data is D・MO・Ml and F-MO・Ml
It is said that Then, when a conversion cancellation command is input, the latest defined position 1 transformation matrix old inverse matrix Ml-' is changed to the transformation matrix M (M=MO
・Ml) (step 5119), and the transformation matrix M
becomes MO, the original data G after the latest position transformation matrix Ml is released is position transformed by the transformation matrix M (M=MO), and the edited data becomes G-MO.

Furthermore, when a conversion cancellation command is input, the inverse matrix MO-l of the latest defined position transformation matrix MO is changed to the transformation matrix M (
M=MO) (step 5119), the transformation matrix M becomes E, and the original data H after all position transformation matrices are canceled is made into direct editing data by the transformation matrix M (M=E).

, 3 z Table 3゜Relationship between transformation and cancellation and transformation matrix The case where the original data is 3-dimensional NC data has been explained above, but it is almost the same as above when the original data is 2-dimensional NC data. .

In the edited data created in this way (see Table 2), position conversion commands and conversion cancellation commands are treated as non-execution data, so during actual machining, the same NC data as shown in Table 4 must be used. The Canadian program will be executed.

Table 41 Canadian program based on edited data Next, the inverse conversion process of the original data creation step of creating original data based on the edited data will be explained.

Note that it is assumed that the edited data shown in Table 2 is stored in the RAM 3 as a target of the inverse conversion process.

FIG. 2 is a flowchart showing an outline of the inverse transformation process, and includes steps 8201 to S206 of the inverse transformation process.
．． Steps 8208 to S2510 and steps 8212 to 5220 are steps 5101 and 5220 of the data conversion process (see FIG. 1), respectively.
~Step 5106. S], 08 to step S110
．． This corresponds to the processing of STEP S 112 to STEP 5120. However, in step 5212 of the inverse conversion process, the unexecuted conversion command block (G9
8PI...), (G98P2...), (G98
P3...), the inverse matrix Ma of the position transformation matrix Ma
That is, the first corresponding points ia, ia, ka stored in the unexecuted conversion command block are converted into the first reference points Xa, VL.
H, and set the second corresponding points ib, jb, kb to the second reference point ib.

yb, zb, and the third corresponding points ic, i
An inverse transformation matrix Ma for moving c, kc to the third reference points XC, VC, H is defined, and in step 8216, the position for mirror transformation is determined from the unexecuted transformation command block (G 98 P O...). Inverse matrix Mb of transformation matrix Mb, that is, located at the midpoint between arbitrary two points id, jd, kd and xd, yd, xd stored in the unexecuted transformation command block, and orthogonal to the straight line connecting the two points. A mirror inverse transformation matrix Mb (substantially the same as Mb) is defined, and these unexecuted transformation command blocks, and
The data of the unexecuted cancel block itself is not written to the RAM 3, and step 51 of the data conversion process
In step 5207, which is a write process corresponding to step 07, the inversely transformed point data of the movement command block and other data are written into the RAM 3 as original data.

Therefore, when inverse conversion processing is performed on the edited data as shown in Table 2, original data as shown in Table 5 is obtained.

Table 5. Original data obtained from inverse transformation Table 6 is an example that conceptually shows the relationship between position transformation commands and transformation cancellation commands that were determined to be non-executable and the inverse transformation matrix M in correspondence with Table 3. At the stage where the inverse matrix is not defined by the position transformation command, the initial value is E.
Edit data 8 is directly used as original data by the inverse transformation matrix M which is a unit matrix, and when the inverse matrix MO of the position transformation matrix MO is defined by an unexecuted position transformation command, the inverse transformation matrix is integrated (step 5214), and the inverse transformation matrix M becomes MO.Edited data B-MO and C-MO after the inverse matrix MO is defined by the unexecuted position transformation command are the inverse transformation matrix M (M= MO), and the original data are set to B and C. Then, after the inverse matrix MO is defined, when the inverse matrix th is defined by another non-executable position transformation command, the inverse transformation matrix M ( MMO)
(step S214), the inverse transformation matrix becomes MO-Ml, and the edited data D-MO after the inverse matrix Ml is defined by the non-executed position transformation command.
・Ml and F-MO ・Ml is the inverse transformation matrix M (M=MO
・Ml), and the original data are converted to D and F. Then, when an unexecuted conversion cancellation command is manually input, the inverse matrix Ml of the latest defined inverse matrix M1 is integrated into the inverse transformation matrix M (M=M(1・Ml) (step 52
19), the inverse transformation matrix M becomes MO, and the latest inverse matrix 11
The edited data G-MO after is released is the inverse transformation matrix M
(M=MO), and the original data is set to G. Furthermore, when an unexecuted conversion cancellation command is input, the inverse matrix MO of the latest defined inverse matrix VO is changed to the inverse transformation matrix M
(M=MO) (step 5219), the inverse transformation matrix M becomes E, and the edited data H after all inverse matrices are canceled is directly converted into original data by the inverse transformation matrix M (M=E). Ru.

Table 6: Relationship between inverse transformation and cancellation and inverse transformation matrix In other words, according to the inverse transformation process of this embodiment, each time a position transformation command stored as non-executable data is read, the above position transformation is performed in the data transformation process. 9 Inverse matrices corresponding to the position transformation matrix defined by the command are sequentially calculated (step S2]-2, step 821.6)
, when position transformation matrices are defined redundantly in the data transformation process, the inverse transformation matrix M is obtained by sequentially integrating the inverse matrices corresponding to these position transformation matrices (step 5).
214), the point defined in the edit data between the position conversion command and the conversion cancellation command stored as non-execution data, that is, the point whose position was transformed in the data conversion process, is multiplied by the above inverse transformation matrix 100. Since the reverse conversion is performed sequentially (step 5218), the reverse conversion is performed only on the data whose position has been converted in the NC data editing process, and proper original data can be reliably reproduced. Furthermore, in the inverse conversion process, position conversion commands and conversion cancellation commands that are considered non-executable data are not written to the RAM 3 as original data (step 5207), and the original data obtained by this inverse conversion process is This is the first NC data that does not include the position conversion command or conversion cancellation command added to edit the NC data (see Table 5).

U According to this embodiment, the position conversion command and conversion cancellation command added to define the position conversion matrix in the data conversion process in the NC data editing process are stored in the edited data as non-executable data. An automatic programming device can automatically calculate the inverse transformation matrix for calculating the original data from the data, and in addition, the data that is subject to position transformation at the stage of data transformation processing is Since it is easily detected as a point defined between the conversion command code and the conversion cancellation command, the original data can be reliably reproduced based on the edited data.

Therefore, even if multiple editing operations are performed using the original data as a reference, there is no need to save each original data as a reference, and the actual storage capacity of the automatic programming device can be increased. .

Effects of the Invention According to the NC data editing method of the present invention, a position conversion matrix is defined based on a position conversion command programmed in the original data, and until a conversion cancellation command is read, the position conversion matrix is defined in the original data. Since the positions of the calculated points are automatically transformed based on the above-mentioned position transformation matrix, complicated manual calculations are not required in the NC data editing process, and the editing work can be performed quickly and reliably. In the edited NC data, the position transformation command and transformation cancellation command that defined the position transformation matrix in the editing process are saved as non-execution data, so the inverse transformation matrix for calculating the original data from the edited data can be automatically created. The data that can be calculated and that is subject to positional transformation in the editing process can be easily detected from the edited data as a point defined between the positional transformation command that is not executed and the transformation cancellation command. Therefore, in the original data creation process, it is possible to determine the data that has been subject to positional transformation and perform appropriate inverse transformation, and the original data can be reliably reproduced based on the edited data. There is no need to store all original data (this can increase the effective storage capacity of the automatic programming device).

3

[Brief explanation of drawings]

FIG. 1 is a flowchart showing an outline of the data conversion process that constitutes the NC data editing process of one embodiment of the present invention, and FIG. 2 shows an outline of the inverse conversion process that constitutes the original data creation process of the same embodiment. Flowchart, FIG. 3 is a block diagram showing the main parts of an automatic programming device of an embodiment implementing this method, FIG. 4 is a diagram conceptually explaining the action of the position transformation matrix in the same embodiment, and FIG. 5 6 is a diagram conceptually explaining the action of the position transformation matrix for mirror transformation in the same embodiment, and FIG. 6 is a diagram conceptually explaining the action of the transformation matrix when two position transformation matrices are defined simultaneously. It is. 1... Processor (CPU), 2... ROM. 3...RAM, 4...NC data storage memory, 5.
...Keyboard, 6...Disk controller, 7.
Graphic display (CRT), 8... bus,
FLI, FL2...floppy disk. 4

Claims (1)

[Claims] In the NC data editing method using an automatic programming device, the original NC data is read in sequence, a position conversion matrix is defined based on the position conversion command programmed in the original data, and a conversion cancellation command is issued after the position conversion command is read. NC data editing that sequentially transforms the positions of the points defined in the original data using the above position transformation matrix, and saves the position transformation command and transformation cancellation command as non-execution data to create edited data until the data is read. When a process and an inverse transformation command are input, the edited data is read sequentially, the inverse transformation matrix of the above position transformation matrix is calculated from the position transformation command saved as non-execution data in the edited data, and the inverse transformation matrix is converted into non-execution data. and an original data creation step of sequentially inversely transforming the points defined in the edited data between the position conversion command and the conversion cancellation command using the above-mentioned inverse transformation matrix, and converting the edited data into original data. Characteristic NC data editing method.