Compressing method for working shape data of shape working system
3 claims: 3 independent, 0 dependent
- 1(57)【特許請求の範囲】 【請求項1】 加工形状データ記憶部に記憶された複数個の連続した線分で構成された加工形状データを加工形状データ圧縮手段で圧縮処理し、その圧縮された加工形状データを利用して形状加工機を動作させ、被加工材料を目的の形状に加工する形状加工システムにおける、加工形状データの圧縮処理方法であって、 上記加工形状データ圧縮手段による圧縮処理は、 上記加工形状データ記憶部から前記加工形状データを読込むステップと、 各線分の直線係数の類似性により、連続した線分が同一直線区間にあるか否かを判定するステップと、 上記連続した線分が同一直線区間にあると判定した場合には、その連続した線分の始点と終点とを直線で結んで新たな線分とし、上記連続した線分を消去するステップと、 上記新たな線分を表すデータを上記加工形状データとして上記加工形状データ記憶部に保存するステップとを含み、 上記連続した線分が同一直線区間にあるか否かを判定するステップは、 上記直線係数の類似性を表す定数δ1 を予め設定するステップと、 ある線分Si を、Z=aX+b、Z=aY+b又はY=aX+bの関数で表し、上記線分Siに続く線分Sj(j:i+1~n) を、Z=a’X+b’、Z=a’Y+b’又はY=a’X+b’の関数で表したとき、 上記直線係数a’が、a±δ1 の範囲内であれば、上記線分Si と上記線分Sj とが、同一直線区間にあると判定し、 さらに、同一直線区間にあると判定された上記線分Sj に続く線分Sj+1がある場合には、上記j+1 をj と設定して新たな線分Sj に対して上記判定を繰り返し行い、上記線分Si の始点を、同一直線区間にある連続した線分の始点とし、同一直線区間にあると判定された最後の線分Sj の終点を、同一直線区間にある連続した線分の終点とするステップとを含む、加工形状データの圧縮処理方法。
- 2【請求項2】 加工形状データ記憶部に記憶された複数個の連続した線分で構成された加工形状データを加工形状データ圧縮手段で圧縮処理し、その圧縮された加工形状データを利用して形状加工機を動作させ、被加工材料を目的の形状に加工する形状加工システムにおける、加工形状データの圧縮処理方法であって、 上記加工形状データ圧縮手段による圧縮処理は、 上記加工形状データ記憶部から前記複数個の連続した線分を取り出すステップと、 各線分の直線係数の類似性により、連続した線分が同一直線区間にあるか否かを判定するステップと、 上記連続した線分が同一直線区間にあると判定した場合には、その連続した線分の始点と終点とを直線で結んで新たな線分とし、上記連続した線分を消去するステップと、 上記新たな線分を表すデータを上記加工形状データとして上記加工形状データ記憶部に保存するステップとを含み、 上記連続した線分が同一直線区間にあるか否かを判定するステップは、 上記直線係数の類似性を表す定数θ1 を予め設定するステップと、 ある線分Si を、Z=aX+b、Z=aY+b又はY=aX+bの関数で表し、上記線分Si に続く線分Sj(j:i+1~n) を、Z=a’X+b’、Z=a’Y+b’又はY=a’X+b’の関数で表したとき、 上記関数で示された線分Si 及び線分Sj において、X・Y・Z軸のいずれかの軸との交差角度θi 及び交差角度θj を求め、上記角度θi と上記角度θj との関係において、上記θj がθi ±θ1 の範囲内であれば、上記線分Si と上記線分Sj とが同一直線区間にあると判定し、 さらに、同一直線区間にあると判定された上記線分Sj に続く線分Sj+1がある場合には、上記j+1 をj と設定して新たな線分Sj に対して上記判定を繰り返し行い、上記線分Si の始点を、同一直線区間にある連続した線分の始点とし、同一直線区間にあると判定された最後の線分Sj の終点を、同一直線区間にある連続した線分の終点とするステップとを含む加工形状データの圧縮処理方法。
- 3【請求項3】 加工形状データ記憶部に記憶された複数個の連続した線分で構成された加工形状データを加工形状データ圧縮手段で圧縮処理し、その圧縮された加工形状データを利用して形状加工機を動作させ、被加工材料を目的の形状に加工する形状加工システムにおける、加工形状データの圧縮処理方法であって、 上記加工形状データ圧縮手段による圧縮処理は、 上記加工形状データ記憶部から前記複数個の連続した線分を取り出すステップと、 各線分の直線係数の類似性により、連続した線分が同一直線区間にあるか否かを判定するステップと、 上記連続した線分が同一直線区間にあると判定した場合には、その連続した線分の始点と終点とを直線で結んで新たな線分とし、上記連続した線分を消去するステップと、 上記新たな線分を表すデータを上記加工形状データとして上記加工形状データ記憶部に保存するステップとを含み、 上記連続した線分が同一直線区間にあるか否かを判定するステップは、 上記直線係数の類似性を表す定数γ1 を予め設定するステップと、 ある線分Si を、Z=aX+b、Z=aY+b又はY=aX+bの関数で表し、上記線分Si に続く線分Sj(j:i+1~n) を、Z=a’X+b’、Z=a’Y+b’又はY=a’X+b’の関数で表し、 上記直線係数aをsinθ若しくはcosθの三角関数値γを用いて表し、上記直線係数a’をsinθ’若しくはcosθ’の三角関数値γ’を用いて表したとき、上記三角関数値γと上記三角関数値γ’との関係において、上記三角関数値γ’がγ±γ1 の範囲内の範囲内であれば、上記線分Si と上記線分Sj とが同一直線区間にあると判定し、 さらに、同一直線区間にあると判定された上記線分Sj に続く線分Sj+1がある場合には、上記j+1 をj と設定して新たな線分Sj に対して上記判定を繰り返し行い、上記線分Si の始点を、同一直線区間にある連続した線分の始点とし、同一直線区間にあると判定された最後の線分Sj の終点を、同一直線区間にある連続した線分の終点とするステップとを含む、加工形状データの圧縮処理方法。
Independent claims3
107 paragraphs in 1 section, as filed
Description: TECHNICAL FIELD [Detailed description of the invention]
【0001】
[Technical field to which the invention belongs]
According to the present invention, in order to process a material to be processed into a desired shape at high speed with a shape processing machine such as a three-dimensional cutting machine or a cutting plotter, the processing shape data is compressed, and the processing shape data is compressed in a shape processing system. It relates to a processing method.
【0002】
[Conventional technology]
Conventionally, when processing a material to be processed into a desired shape with a shape processing machine such as a three-dimensional processing machine or a cutting plotter, compression processing such as deleting useless point data and useless line segment data is performed. Shape data is used. As a method of the compression processing, for example, it is known to replace a plurality of continuous line segments in the same straight line section with one line segment. Such a data compression processing method is disclosed in Japanese Patent Application Laid-Open No. 3-230201.
【0003】
The compression processing method of the processed shape data disclosed in JP-A-3-230201 will be described with reference to FIG. First, let any one point in one path be the starting point P0, and draw a straight line l0 between the closest points P1 separated by the parameter "straight line distance" C or more in a certain direction on the starting point. Next, consider two straight lines l1 and l2 that are translated left and right by half of the parameter "straight line width" D from this straight line l0, and delete the points included in the lines l1 and l2. Next, restore P2, which is the farthest point from the start point P0 among the deleted points, and repeat the same process as above with that point P2 as the start point. Here, the "straight line distance" C is set as the minimum value of the distance between each point, for example, 1 mm, and the "straight line width" D is set to a permissible range of machining accuracy.
【0004】
According to the above-mentioned compression processing method of processed shape data, a plurality of line segments in the same straight line section can be replaced with one line segment.
【0005】
[Problems to be Solved by the Invention]
However, the above-mentioned processing shape data compression processing method has a problem that the data compression processing takes time because the processing for detecting the same straight line section is complicated.
【0006】
Further, the above-mentioned "straight line width" D must be set appropriately according to the size of the shape to be processed, which is very troublesome for the operator.
【0007】
Furthermore, as shown in Fig. 9, when there are multiple line segments in the same straight line segment that are useless (abnormal) paths that go from a certain start point P0 to a point P2, turn back, and return to a point P3 near the point P0. , When processed by the above compression processing method, unnecessary points P1 and P3 within the same straight line interval are deleted, the start point P0 and the farthest point P2 are connected by a straight line, and then the point P2 is the starting point after the point P4. Processing is performed for the point.
【0008】
In this way, the compression processing method cannot eliminate the folded straight line that returns to the vicinity of the start point within the same straight line section. Therefore, if processing is performed according to the data processed here, unnecessary cuts are made in the material to be processed. Will occur.
【0009】
The present invention has been made in view of such circumstances, and an object of the present invention is to compress the processed shape data by a simple and high-speed method without the need to set parameters according to the size of the processed shape. It is an object of the present invention to provide a method for compressing processed shape data in a shape processing system, which can surely eliminate a line segment that becomes a useless (abnormal) path.
【0010】
[Means for solving problems]
In order to achieve the above object, the processing method for compressing the processed shape data in the shape processing system according to the present invention is for each line segment S (1 to n) for the processed shape data composed of n continuous line segments. Based on the similarity of the linear coefficients of, it is determined whether or not the continuous line segments Si (i: 1 to n-1) to Sj (j: i + 1 to n) are in the same straight line section, and the continuous line segments are determined. If it is determined that Si (i: 1 ~ n-1) ~ Sj (j: i + 1 ~ n) are in the same straight line section, it will be the starting point of the line segment Si (i: 1 ~ n-1). Connect the end point of Sj (j: i + 1 ~ n) with a straight line to make a new line segment, and erase the line segment Si (i: 1 ~ n-1) ~ Sj (j: i + 1 ~ n). I am doing it.
【0011】
In the above processing method for compressing the processed shape data, for example, the line segment S1 is represented by the function of Z = aX + b, and the line segment S2 continuous with the line segment S1 is represented by the function of Z = a'X + b'. Then, if the linear coefficient a a', there is similarity, and it is determined that the line segment S1 and the line segment S2 are in the same straight line section, and if the linear coefficient a a', there is no similarity. It is determined that the line segment S1 and the line segment S2 are not in the same straight line section. If the line segment S1 and the line segment S2 are in the same straight line segment based on the above judgment, the start point of the line segment S1 and the end point of the line segment S2 are connected by a straight line to form a new line segment, and the line segment S1 And the line segment S2 is erased.
【0012】
Regarding the similarity, a constant δ1 representing the similarity of the linear coefficients may be set in advance, and when the linear coefficient a'is within the range of a ± δ1, it may be considered that there is similarity.
【0013】
Further, instead of the constant δ1, the constant θ1 of the angle element is set in advance, and the θ'is θ'in the relationship between the angle element θ of the linear coefficient a and the angle element θ'of the linear coefficient a'. If it is within the range of ± θ1, it may be judged that there is similarity.
【0014】
Further, instead of the constant δ1, the trigonometric function value constant γ1 is set in advance, the linear coefficient a is expressed using the trigonometric function value γ of sinθ or cosθ, and the linear coefficient a'is sinθ'or cosθ'. When expressed using the trigonometric function value γ', the relationship between the trigonometric function value γ and the trigonometric function value γ'is similar if the trigonometric function value γ'is within the range of γ ± γ1. You may judge.
【0015】
As described above, in the processing method for compressing the processed shape data in the shape processing system according to the present invention, the same straight section can be searched by a simpler and faster method than the conventional search for the same straight section. The time required for data compression processing is short.
【0016】
In addition, the constant δ1 (θ1 or γ1) representing the similarity of the linear coefficients sets specific dimensional values such as straight line distance C and straight line width D, which are parameters of the conventional data compression processing method. It is not necessary to change the inclination of the line segment, the angle with respect to each axis, etc., so that it does not need to be changed according to the size of the shape to be processed.
【0017】
Further, in the processing shape data compression processing method of the present invention, when it is determined that the continuous line segments Si (i: 1 to n) to Sj (j: i + 1 to n) are in the same straight line section, , The start point of the line segment Si (i: 1 ~ n) and the end point of the line segment Si (j: i + 1 ~ n) are connected by a straight line to form a new line segment, and the line segment Si (i: 1 ~ n) ~ Sj Since (j: i + 1 ~ n) is deleted, it becomes a useless (abnormal) route that goes from P0 to the point P2 and wraps back to the point P3 near the point P0 as shown in Fig. 9. All of the multiple line segments are determined to be in the same straight line section, and are deleted after the points P0 and P3 are connected. In this way, useless (abnormal) line segments that were not erased by the conventional data compression processing method are surely erased.
【0018】
BEST MODE FOR CARRYING OUT THE INVENTION
Next, the present invention will be described with reference to the drawings. FIG. 1 is a system configuration diagram showing a specific example of a three-dimensional shape processing system that realizes the present invention, and FIG. 2 is an explanatory diagram illustrating a processing example by the three-dimensional shape processing system shown in FIG. In the figure, 1 is a three-dimensional shape data storage unit, and data expressing a target three-dimensional shape 2 is stored. Reference numeral 3 denotes an offset shape calculation unit, which reads 3D shape data D1 from the 3D shape data storage unit 1, creates offset shape data D2 by the cutting tool 4 based on the data D1, and stores the 3D shape data data. Save to Part 1.
【0019】
Reference numeral 5 denotes a cut surface shape calculation unit, which reads offset shape data D2 from the 3D shape data storage unit 1 and calculates a continuous line segment 6'indicating a tool path 6 for each cut surface based on the data D2. Create the processed shape data D3 and save it in the processed shape data storage unit 7. Reference numeral 8 denotes a processed shape data compression unit, which reads the processed shape data D3 from the processed shape data storage unit 7, creates the compressed processed shape data D4 based on the data D3, and saves it in the processed shape data storage unit 7. To do. The processed shape data compression unit 8 creates a new line segment connecting the start point and the end point of the continuous line segment in the continuous line segment A in the same straight line section, and erases the line segment A. Further, the same compression processing is performed on the continuous folded line segment B in the same straight section.
【0020】
Reference numeral 9 denotes a machining shape data generation unit, which reads the compressed machining shape data D4 from the machining shape data storage unit 7, creates the final machining shape data D5 based on the data D4, and eliminates tool interference, etc., and creates the final machining shape data D5 based on the data D4. Is stored in the processed shape data storage unit 7. Reference numeral 10 denotes a machining shape data output unit, which reads the final machining shape data D5 and outputs the data D5 to the 3D cutting machine 11. The offset shape calculation unit 3, the cut surface shape calculation unit 5, the processing shape data compression unit 8, the processing shape data generation unit 9, and the processing shape data output unit 10 each include a ROM having an execution program. Execution programs are executed by a common CPU.
【0021】
FIG. 3 is a flowchart showing the data compression processing procedure of the processed shape data compression unit 8. Next, the process of compressing the processed shape data D3 composed of n line segments S (1 to n) will be described with reference to FIG. Here, the line segment currently being processed is defined as a line segment Si (i: 1 to n), and the line segment after that is defined as a line segment Sj (j: i + 1 to n).
【0022】
First, in step 1, let i be 1 of the line segment Si (i: 1 to n). Next, in step 2, the line segment Si is represented by a function of Z = aX + b, and the linear coefficients a and b are obtained. Then, in step 3, i + 1 is set to j. Then, in step 4, the line segment Sj is represented by a function of Z = a'X + b', and the linear coefficients a', b'are obtained.
【0023】
Next, in step 5, whether or not the relationship between the linear coefficient a of the line segment Si and the linear coefficient a'of the line segment Sj is aa', that is, the line segment Si and the line segment Sj are the same straight line. Determine if it is in a section. Here, aa'is a-δ1 a'a + δ1, and the above δ1 is a preset constant representing the similarity of the linear coefficients. The above constants δ1 and are 1.0 × 10.<sup>-6</sup>Degree is preferable.
【0024】
If the judgment result of step 5 is NO, the process proceeds to step 8. If the judgment result of step 5 is YES, j + 1 is set to j in step 6. Then, in step 7, it is determined whether or not j> n, that is, whether or not the line segment Sj does not exist.
【0025】
If the judgment result of step 7 is YES, the process proceeds to step 8, and if the judgment result of step 7 is NO, the process returns to step 4. As a result, the similarity between the above line segment Si and the new line segment Sj is determined again.
【0026】
In step 8, it is determined whether or not j> i + 1, that is, whether or not the line segment Sj is the line segment after the line segment Si. If the determination result in step 8 is NO, the process proceeds to step 11, and if the determination result in step 7 is YES, the process proceeds to step 9.
【0027】
In step 9, connect the start point of the line segment Si and the start point of the line segment Sj with a straight line. That is, new line segment data is created by connecting the start point of the line segment Si and the end point of the last line segment Sj-1 determined to be in the same straight line section as the line segment Si. Then, in step 10, the line segment data of the line segment Sj-1 is deleted from the line segment Si.
【0028】
In step 11, set j of the line segment Sj to i. Then, in step 12, it is determined whether or not i> n, that is, whether or not the new line segment Si set in step 11 exists. If the determination result in step 11 is NO, the process proceeds to step 2 and processing is performed for the new line segment Si. If the determination result in step 11 is YES, the compression process for the processed shape data D3 is terminated.
【0029】
FIGS. 4 and 5 show an example of compression processing of the processed shape data D3. First, in the line segments S1 to Si + 2 shown in Fig. 4 (a), Si: Z = a0X + b0, Si + 1: Z = a1 X + b1, Si + 2: Z = a2 X + b2, respectively. It is represented by the function of, and the relationship between these linear coefficients is a0 a1 a2. In this case, according to the above compression process, the line segments S1 to Si + 2 are regarded as the same straight line section, the start point P0 and the end point P1 of the same section are connected by a straight line to create a new line segment, and the original line segment S1 ~ Erase Si + 2. Therefore, what was composed of three line segments S1 to Si + 2 is composed of one line segment as shown in Fig. 4 (b).
【0030】
Next, in the folded line segments Si to Si + 3 shown in Fig. 5 (a), Si: Z = a00X + b00, Si + 1: Z = a01 X + b01, Si + 2: Z = a02 X, respectively. It is expressed by the functions of + b02 and Si + 3: Z = a03 X + b03, and the relationship between these linear coefficients is a00 a01 a02 a03. In this case, according to the above compression process, the line segments S1 to Si + 3 are regarded as the same straight line section, the start point P0 and the end point P1 of the same section are connected by a straight line to create a new line segment, and the original line segment S1 ~ Erase Si + 3. Therefore, there is no useless folded part, and it is composed of one short line segment as shown in Fig. 4 (b).
【0031】
In the above specific example, the XZ plane is used as the cut surface, but the YZ plane may be used. In this case, the function representing the line segment is Z = aY + b.
【0032】
Next, another specific example in which the similarity of the linear coefficients is determined based on the angle element θ of the linear coefficients will be described with reference to FIG. The above-mentioned determination of the similarity of the linear coefficients was performed by simply comparing the slope value of the line segment Si (linear coefficient a) and the slope value of the line segment Sj (linear coefficient a'). As shown in, for each line segment Si ~ Si + 2, find the angles θi ~ θi + 2 where the X axis and each line segment intersect, and if those angles are θi θi + 1 θi + 2, the above It may be determined that the line segments Si to Si + 2 are in the same straight line section.
【0033】
That is, the constant θ1 representing the similarity of the linear coefficients is set in advance, the line segment Si is represented by the function of Z = aX + b, and the line segment Sj (j: i + 1 to n) following the line segment Si ) Is expressed by the function of Z = a'X + b', and at the line segment Si and the line segment Sj shown by the above function, the intersection angle θi and the intersection angle θj with the X axis are obtained, and the above angle θi In relation to the angle θj, if the θj is within the range of θi ± θ1, it is determined that the line segment Si and the line segment Sj are in the same straight line section. The function Z = aX + b indicating the above line segment is Z = tanθX + b, and comparison may be performed using this angle θ.
【0034】
The above function Z = aX + b can also be expressed as Z = sinθX / cosθX + b. Therefore, the similarity of the linear coefficient a may be determined by comparing the sinθ value or the cosθ value.
【0035】
That is, the constant γ1 representing the similarity of the linear coefficients is set in advance, the line segment Si is represented by the function of Z = aX + b, and the line segment Sj (j: i + 1 to n) following the line segment Si ) Is represented by a function of Z = a'X + b', the linear coefficient a is represented by a triangular function value γ of sinθ or cosθ, and the linear coefficient a'is represented by a triangular function value γ of sinθ'or cosθ'. When expressed using', in the relationship between the triangular function value γ and the triangular function value γ', if the triangular function value γ'is within the range of γ ± γ1, the line segment Si It is determined that the line segment Sj is in the same straight line section.
【0036】
So far, regarding the method of determining the similarity of the linear coefficients, the one for comparing the value of the linear coefficient a, the one for comparing the angle element θ in the linear coefficient a, and the trigonometric function value (sinθ value or cosθ value) in the linear coefficient a are used. I have listed what to compare. The above feature is that the arithmetic processing can be performed in a short time, but when the line segments are almost vertical, the values of a and a'are near , and it is judged that most of them have no similarity. Since the similarity of line segments is compared by the angle element θ and sin θ value, it is not difficult to judge the similarity due to the slope of the line segment, but the calculation processing time becomes longer. ..
【0037】
Therefore, the above methods may be used in combination to make the best use of their respective characteristics. For example, as shown in FIG. 7, when the value of the linear coefficient a is 1.0 or less (the intersection angle θb between the X axis and the line segment is 45 ° or less), the above determination method is used, and the value of the linear coefficient a is 1.0. When it is large (the intersection angle θb between the X-axis and the line segment is larger than 45 °), the above or the determination method may be used.
【0038】
The specific examples described so far show a data compression method for processing shape data used in a three-dimensional processing machine, but the present invention is not limited to this, and the two-dimensional used in a cutting plotter or the like. It can be adopted as a data compression method of the processed shape data of. In this case, the function representing the line segment is Y = aX + b and so on.
【0039】
[Effect of the invention]
The present invention is carried out in the manner described above, and has the effects described below.
【0040】
In the processing method for compressing processed shape data in a shape processing system according to the present invention, it is determined whether or not continuous line segments are in the same straight line segment based on the similarity of the linear coefficients of each line segment, and the continuous line segments are determined. When it is determined that they are in the same straight line section, the start point and the end point of the continuous line segment are connected by a straight line to form a new line segment, and the continuous line segment is erased. According to the present invention, even with such a simple method, the processed shape data can be compressed at high speed and a line segment that becomes a useless (abnormal) path can be surely eliminated. In addition, since the similarity of the linear coefficients of each line segment is examined to determine whether or not continuous line segments are in the same straight line section, parameters are set according to the size of the machined shape. It is extremely practical without the need for.
[Simple explanation of drawings]
[Figure 1]
It is a system block diagram which shows a specific example of the 3D shape processing system which realizes this invention.
[Figure 2]
It is explanatory drawing explaining the processing example by the 3D shape processing system shown in FIG.
[Fig. 3]
It is a flowchart which shows the data compression processing procedure of the processing shape data compression part shown in FIG.
[Fig. 4]
It is explanatory drawing explaining an example of compression processing of processing shape data (the thing which a plurality of line segments are on a straight line).
[Fig. 5]
It is explanatory drawing explaining an example of compression processing of the processing shape data (the thing which a plurality of line segments of folding are on a straight line).
[Fig. 6]
It is explanatory drawing explaining another concrete example about the determination of the similarity of a linear coefficient.
[Fig. 7]
It is explanatory drawing explaining the specific example using a plurality of methods for the determination of the similarity of a linear coefficient.
[Fig. 8]
It is explanatory drawing explaining the compression processing method of the conventional processing shape data (the thing which a plurality of line segments are on a straight line).
[Fig. 9]
It is explanatory drawing explaining the compression processing method of the conventional processing shape data (the thing which a plurality of line segments of folding are on a straight line).
[Explanation of symbols]
a, b linear coefficient D3 Machining shape data P0 starting point P1 end point Si line segment Line segment following Sj Si δ1, θ1, γ1 Constants representing the similarity of linear coefficients 8 Machining shape data compression unit
9 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| JP5202735B2 | Cited by | Japan | Examiner |
| US2017123402A1 | Cited by | United States of America | Pre-grant |
| WO2010140390A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| JP2013012167A | Cited by | Japan | Examiner |
| US8560112B2 | Cited by | United States of America | Applicant |
| US10268184B2 | Cited by | United States of America | Search report |
| CN102428419A | Cited by | China | Search report |
| US9377776B2 | Cited by | United States of America | Applicant |
| JP6275711A | Cites | Japan | – |
13 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Cancellation because of no payment of annual feesLAPS | LAPS | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 |
Numbers
- Publication
- 3459155
- Application
- 8216683
Titles2
- Japanese
- 形状加工システムにおける加工形状データの圧縮処理方法
- English
- [Title of the Invention] A method for compressing processed shape data in a shape processing system.
Classification
- IPC, 4
- B23Q15 00
- G05B19 4097
- G06T9 00
- G06T9 20
