JPS5856080A - Line pattern compression system - Google Patents

Abstract

PURPOSE:To save the occupancy of a memory, to use the memory for other processing, and to improve the efficiency of data processing, by integrating strokes without expanding strokes in the memory. CONSTITUTION:The 1st stroke to be integrated is applied to the 1st contact segment equation parameter calculating circuit 1, and the 2nd stroke is applied to the 2nd contact segment equation parameter calculating circuit 2 to find equations of terminal segments respectively; and an equation coincidence detecting circuit 3 finds coincidence and outputs a code L which corresponds to the coincidence. Further, a terminal-point coincidence detecting circuit 4 detects the coincidence between the starting points and ending points of the 1st and 2nd strokes, and outputs a code P. Furthermore, a terminal-point segment duplication detecting circuit 5 outputs a code integrating circuit 6 integrates the codes L, P and S to output a stroke-couple duplication code. According to the output, the 1st and 2nd strokes are integrated by a stroke integrating circuit to improve the efficiency of data processing.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a line diagram compression method, in which in a line diagram composed of a qIIK series, two strokes have a common point, i has a shared line segment, and 1 This invention relates to a line graphics compression method that compresses data of two strokes into one tree of four strokes when these two strokes can be expressed as one stroke.

For example, Fig. 1 (a) 1st stroke Il & point 1 at K
→2→5→end point 4) and second stroke 1 (starting point A, B-
, C→end point D), it is better to store them as a single line than to store them as separate lines.9 points A, Because the data in step 4 can be omitted.

Data can be compressed.

Conventionally, when performing such integration processing of two strokes, a two-dimensional planar memory M is used as shown in FIG. : Develop the first stroke I and the #r2 stroke on the mesori M of , and convert it into a pattern of rIJ and rOJ on this two-dimensional plane (
In the figure, the black dots are "1" indicating the existence of each stroke)
, then this "1", "0" pattern #J This is one stroke (starting point 1 → 2 → 5 → B-, C → ending point D
) was re-extracted.

Therefore, when these strokes exist in a wide range, a two-dimensional flat memory M necessary for the expansion of these strokes needs a large area. When processing, a large amount of 2
A dimensional plane area must be secured on the mesori of the data processing device, which has a disadvantage in that it has a large influence on other objects when such graphic processing is performed, and data processing efficiency is reduced.

Therefore, an object of the present invention is to convert the strokes into meridian K t
To provide a line graphic compression method that compresses data by integrating two strokes into one stroke without expanding it into an rOJ pattern. To this end, the line figure compression method of the present invention includes: an end point segment coincidence detection means for detecting whether the end point segments of the first stroke line and the end point segments of the second stroke line match; end point coincidence detection means for detecting a state in which an end point of the first stroke and an end point of the second stroke match;

end point segment overlap state detection means for detecting an overlapping state of the end point segments of the first step) H-ri and the second stroke; integration control means for instructing an integration mode with the second string four;

Integrating means for integrating the first stroke and the second stroke based on the integrated control signal output from the integrated control means is provided, thereby integrating the first stroke and the second stroke. The fact that he did this is considered a special case.

Before describing the present invention in detail based on one embodiment.

I will explain the principle.

In the present invention, when the overlapping relationship between the end points of two consecutive strings is converted into a - code and used as a single area, this code information is used.
In this system, data is compressed by merging the two effective pulleys into one straight pulley. Therefore, the overlap relationship in Km is changed to ;-.

Next, we will perform the process of integrating stroke pairs for the types of duplicate codes. For this purpose, we will explain: This will be explained with reference to the figures and FIG.

■ Stroke pair overlap; creating two strokes (s) and o-ri (coordinate point series with direction)
Depending on the state of the overlapping relationship i between the end points (starting point and ending point), it can be classified into nine types as shown in codes 1 to 8 and 0 in FIG. So create stroke vs. overlap code depending on these conditions. Here, the starting point of the first stroke is 81, the second point (reflection point) is 8;, the end point is Tori, the point before the end point is B;, and the octopus (8*
, 8; ), let lI be the straight line k,
ir ) is defined as IF. Similarly, for the second strike four, S81, Tori, Tori and 1g,
Define d.

As shown in the first linear example at the top of FIG. 2, the end point island of the first stroke and the start point S of the second stroke coincide, and the IF of the first stroke and the / f does not match (IF←lr>, that is, 17
When and lI do not overlap, lN-1 is assigned as the strike four duplicate code IN. Similarly, as in the i-th linear example, the end point island of the first step (1) and the end point 4 of the second step (el) coincide.

And if d of the first stroke and d of the second stroke do not match, the stroke pair overlaps;
Grant. Then, as in the fifth linear example, pF of the first strip p and N of the second strip ν match, and the end point E of the first strip a is the point (8 m, 8;), and the starting point 81 of the second strike 11 is between the points ("1 s L ), and the point (.8;) is between the points (.
If there is a value between s and s, then IN=5 is assigned as the stored vs. duplicate code IN.

Also, like the sixth linear example, the first step)
F and lr of the second stroke match, and the end point of the first stroke is located between the points (bird, B;) and the point (1;, B
;) Between and 4, the end point B of the second stroke is the point (
K between Et, Bs) KTo and K between (Es, g)
When to, input as a duplicate code IN,
, 4 is given. In this way, as shown in Fig. 2,
When the start points or end points match in the states shown in Examples 1 to 4, K assigns stroke overlap pair codes IN1 to IN4. If there is an overlapping line segment part in the states shown in linear examples 5 to 8, the stroke overlapping pair code IN5 is applied.
Give ~8. However, in other cases, it is assumed that there is no overlapping relationship and the stroke overlapping pair code INO is assigned. As an example of this other case, there is also an example where some of the line segments match, and as shown in II-form example 8, 1! F and/:
may match. But in this case.

As shown in FIG. 5(a), it was decided that the first stroke (2) and the second stroke (2) could not be integrated because they overlapped at the starting point. Of course, as in Figure 3 (b), where the first stroke 1 and part of the second stroke 2, which cannot be integrated, are in an overlapping relationship, this is also included in this other example, and the two strokes overlap. IN= indicates that there is no overlapping relationship as a code
The addition of Q means K.

■ Integration of stroke pairs If the stroke pair duplication code IN is other than 0, it is a stroke pair that can be integrated, so the stroke pair is Integrate each duplicate code) o-
Create a file and perform data compression.

For example, in the case of linear example 1, the end point 1i1 of the first stroke
1 and the start point s1 of the 2nd step) E-way are the same, but the starting point 8 of the 2nd step) a-way is omitted and the integrated rule jll
l As shown in K<(8s,...,B,,s;,...,
(Bird) Data compression can be performed. In addition, in the case of linear example 2, the end point B1 of the first stroke and the end point E1 of the second stroke coincide, but the first stroke 1=
- Omit the end point H1, as shown in the integration rule (81
..."l e Bl...8s). Thus, in the case of S) a-ri versus duplicate code IN2, the data can be compressed by the end point B1. Then, the linear In the case of Example 5, the end point E1 of the first stroke and the start point 81 of the second stroke are omitted, and the new integrated stroke is (8t...I!i; 8;...E
x), so the stroke vs. 16 code IN
When is 5, it is possible to compress data by 8 times compared to El. Combining strokes vs. duplicate code I
When the start point or end point where N is expressed as IN=1 to 4 match, only one point can be compressed, and the code 5 to B
When expressed as , only two points can be compressed.

Generally, the first stroke is (Ss, 8;...";
s”s).

The second stroke is represented by fi1 point consisting of (s, , 8S...E;, bird).

When the integrated stroke is represented by n points such as (ax, am...maro,), the above lN-1 to 4 are n (m + m-1), and the above lN-5 to 8 are n sw ( nl+ am-2)
Next door.

It is possible to delete one or two dust marks depending on the type of the stroke quadrature and the duplicate code, and it is possible to obtain data-compressed strokes.

Next, an embodiment of the present invention for performing data compression as described above will be explained based on FIGS. 5 and 6.

FIG. 5(a) is an example of a stroke pair duplication code generation circuit, FIG. 5(b) is an explanatory diagram of its operating state, and FIG. 6 is an example of a stroke four-way integrated circuit.

In FIG. 5(A), 1 is a first end point segment equation parameter calculation circuit, and the starting point 81. of the first stroke $. Based on the second point 8-1, the point E which is one place before the end point, and the end point 11, end point segments zF and /
The equation of F is calculated, and the parameters of each of these straight lines are calculated. 2 is a second end point segment equation parameter calculation circuit.

Based on the start point of the second stroke $, the second point P, the point one point before the end point, and the end point BsK, calculate the equations of lf and 1F, and calculate the parameters of each of these straight lines. is calculated.

Reference numeral 5 denotes an equation coincidence detection circuit, in which the first end point segment equation parameter calculation circuit 1 calculates the first end point segment, each method 1 of the nine end point segment 1relF, and the second end point segment equation parameter calculation circuit 2 calculates the abbreviation. It compares the equations of the endpoint segments l: and IF to detect whether these endpoint segments match or not, and outputs the following hood L depending on whether they match or do not match. (Please note that this code L is the same as the string corresponding to the straight hood vs. overlapping hood IN shown in FIGS. 2 and 4.) When IF-/, Code L-5N-IF
When code L-61? -1F Code L-71: wmlF f) ト@ :t-)'
Lm8 When none of the above is true, the board L-04 is an endpoint coincidence detection circuit, and detects two sets of endpoints (8* e l1
ls) a (Smm B,), and outputs the following code P depending on the match/mismatch state. (Note that Jin's code P is the stroke pair overlap code IN Ic shown in Figures 2 and 4.
It is noted that it corresponds to a round shape. )Bl -f3 mushroom When code p-1) When 31 Peng E1 When code P-28 is -81 When code p=5 s, -g, When code P=4 None of the above! This is a code P-05 end point segment duplication detection circuit, in which each point 8□t81eBleE1 that makes up the end point segment) IF, and each point s that makes up the end point segment) l: * /f.

The following code S is generated depending on the relationship between 8;, %, and E. (This code 8 corresponds to the stroke pair overlap; -do INK shown in FIG. 2.

Therefore, it should be noted that those K in FIG. 4 also correspond. ) When the island is between the gap ([,8;) between (bird, seagull), the code Sm5 & is between the gap (shoulder, %) between g8a (K, &) , 1g) and between (X, %), and between g&a (&, K) and between (X, ≦), the screen code 8-6 81 is (83, 8;) is between and (8t, to), and is also between (& , 8;) and (8't, 8
'*) Code 8-7 81 is between (&, ni) and (8't, ni) between 0, and ``s ha (1st * 8's) O between ka (
S's t B;) KI Ruto 1 between O! Code 8-8 When none of the above applies; - Code 8-06 is the above 1
Expression matching detection circuit 3. Based on the code L, code P and code 8 respectively output from the end point coincidence detection circuit 4 and the end point segment duplication detection circuit 5, it is determined whether the first stroke $1 and the second stroke $1 can be integrated.

If it is possible to integrate them, it is determined which one is shown in FIGS. 2 and 4, and a corresponding stroke pair overlap code is output. In this case, the code L-
In the case of code 8, it corresponds to the linear examples 5 to 8 above, and Tob is used as the stroke versus overlap code IN.
(i.e., stroke vs. heavy equipment code IN - Hood L).

And: In the case of F-do L-0 and the code P is 1 to 4
In the case of 0, it corresponds to the linear examples 1 to 4 above,
output P as stroke vs. duplicate code IN (i.e., stroke vs. duplicate code)"IN=:r-do-P
), otherwise these two strokes cannot be integrated, and 0 is output as the stroke pair overlap code IN.

1115(a) and the operating state in the integrated circuit 6 are collectively illustrated from FIG. 5(b)K.

In FIG. 6, 7 is a first stroke rearrangement circuit, which controls each point (8*, s;
...1;, Ex) is being transmitted. Then, the state of each point is determined by deleting the first s)s=-i duplicated point from the s)a-ri duplicated code INK output from the integration circuit 6, and rearranging the order. For example, if the stroke pair overlap code lN-2 is applied, then the end point Ii of the first stroke $1! 1 and start point S of the first stroke! Since is the end point of the new integration S)o-ri$,
The arrangement needs to be rearranged as shown in the second half of the integration rule 0 shown in the fx4 diagram - hence this first stroke $t-(at).

Sl...Ht, &) Stroke Saws (pjl
, . . . 81.8) (here, 8 is arranged at the most edge because it becomes the end point of the integrated stroke). Similarly, when the stroke pair duplication code IN-6 is transmitted, the end point E1 of the first stroke $1 is deleted and its arrangement is changed.

8 is a second stroke rearrangement circuit, and each point of the second stroke $1 (Ss e s, , -, E; , Bs
) is being transmitted. The state of each point is the stroke pair overlap output from the integrated circuit 6;
On the other hand, the duplicate points of the second stroke are deleted, the order is rearranged, and the stroke is converted into a stroke $-.

It performs the same operation as the first step) a-rearrangement circuit 7.

Reference numeral 9 denotes a stroke combination circuit, which combines the strokes $# and $# that can be outputted from the wE1 stroke rearrangement circuit 7 and the second stroke rearrangement circuit 8 into stroke pairs;
0 For example, in the case of stroke pair duplication code INKO, the second stage) o-ri $ Proverbs rearranged and transformed S）o-ri$
- is on the starting point side and Strone $-, which has been deleted and converted from '&Li1lx)ty-/$, is on the ending point side, so each point is output from the stroke coupling circuit 9 in the state shown in FIG.

Also, in the case of stroke versus heavy covering code E N5.

Converted strokes from the first stroke array circuit 7 and the second stroke array circuit 8 in which the end point B1 is deleted from the first stroke $1 and the start point S is deleted from the second stroke $1. )0-ri$; , $;but straw-ri$;
Each point can be outputted from the Strawn coupling circuit 9 as an integrated stroke so that the stroke $; becomes the starting point 11 and the stroke $; becomes the end point. And as is clear from Figure 4,
Transmitted from the first stroke re-arranging circuit 7 and the second stroke re-arranging circuit 8 and transformed into s) o-ri $-,
$m is the integrated strike and loan $m from the stroke coupling circuit 9 depending on whether the overlapping code IN is odd or even.
are combined and produced as shown below.

When the stroke vs. overlap code IN is an odd number, $-(s); when the stroke vs. overlap code IN is an even number, $-(s;
, a;).

Next, FIG. 2 shows the operations shown in FIGS. 5 and 6.

This will be explained with reference to FIG.

(1) In Fig. 5, the first stroke $1 to be integrated is applied to the first end point segment equation parameter calculation circuit 1, and the second end point segment equation parameter calculation circuit 1 is applied to the second stroke $1. applied to calculation circuit 2, respectively at the end points) /F, /? .

1: Each equation of H/F is found. Each of these equations is then transmitted to the equation-paper detection circuit 3, and the equations are matched by comparing their respective parameters.

The discrepancy is determined and the code L is determined accordingly. At this time, the first stroke is $1 and the second stroke is $2.
In the case of the state shown in linear example 5 in FIG.

/F-/F, and code L-5 is output.

(2) Also, the starting point Sly of the first spinning stroke $1, the ending point El, and the starting point 8m and the ending point E of the second spinning stroke $1! are respectively applied to the endpoint-paper detection circuit 4 to detect whether they match or not. In this case, since they do not match, code P=0 is output.

(The starting point of the first stroke $1 may be 31 cm. 8..41
Point 8 next to the point; a point Et before the end point; and a point E1 before the end point.

2nd stroke $2) Same e (81, 8; , H's
#g, o Each A is applied to the end point segment duplication detection circuit 5, and the code 8 as described above is created based on the positional relationship of each point. And in this case, the first step) o-ri $
1 endpoint segment) I! F and the end point segment of the second stroke $1) Since /F is in the state shown in linear example 5 in FIG. 2, t code 8■5 is output.

(4) These codes L-5, *-do P-○, and code 8-5 are transmitted to the code integration circuit 6.

As a result, s) ty-ri pair overlap; The signal is transmitted to the coupling circuit 9.

(5) By the way, since the first stroke $1 is input to the first stroke rearrangement circuit 7 and the second stroke $1 is input to the second stroke rearrangement circuit 8, the second stroke $1 is input to the second stroke rearrangement circuit 8. According to the integration rule shown in Figure 4, the first stroke $ is outputted from the first stroke rearrangement circuit 7 as the stroke $ with its end point H1 deleted, and the second stroke $
3 becomes a stroke $ from which the starting point s snow has been deleted and is output from the second stroke p-rearrangement circuit 8. The stroke of the fins $;.

It is input to the $---st m-g' combination circuit 9, and as shown in the integration rule in Fig. 4 (Sl...B;, 8;...bird)
are arranged in the form of and output as an integrated stroke $.

In this way, a new compressed stroke can be obtained by deleting the end point H1, the second stroke $3, and the starting point S of the first stroke S1.

As explained above, according to the present invention, two consecutive 2-)
Step) Create a redundant code that expresses the overlapping relationship between the end points using 1. If there is an overlapping relationship, remove the overlapping points according to the overlapping code and create two strings. Data can be compressed in one stroke. Therefore, according to the present invention, it is possible to integrate strokes without developing or developing a pattern of strokes on a mesori, so it is possible to significantly save the exclusive layer of the mesori. , you can use Mesori for other processing.

As a result, data processing efficiency can be greatly improved.

[Brief explanation of the drawing]

FIG. 1 is an explanatory diagram of the conventional integrated processing of strike μm. Figures 2 to 4 are detailed explanatory diagrams of the present invention, and Figure 5 (A).
5(b) is an example of the stroke pair duplication code generation circuit according to the present invention, and FIG. 5(b) is an explanatory diagram of its operating state. FIG. 6 shows an example of a four-way integrated circuit according to the present invention. In the figure, 1 is a first end point segment equation parameter calculation circuit, 2 is a second end point segment equation parameter calculation circuit, 3 is an equation match detection circuit, 4 is an end point match detection circuit, and 5
is an end point segment duplication detection circuit, 6 is a ;-do integration circuit,
Reference numeral 7 indicates a first stroke rearrangement circuit, 8 a second stroke rearrangement circuit, and 9 a first stroke rearrangement circuit. 1st eye 2nd eye

Claims (1)

[Claims] (1) An end point segment coincidence detection means for detecting whether an end point segment of a first stroke and an end point segment of a second stroke match; an end point coincidence detection means for detecting a state in which the end points of
an end point segment overlap state detection means for detecting a 0 overlap state (end point segment of stroke); and integrated control for instructing an integration mode of the first stroke and the second stroke field according to the detection state of each of the detection means. and an integrating means for integrating the first stroke and the second stroke based on an integrated control signal output from the integrated control means, thereby controlling the first stroke and the second stroke. A line graphics compression method characterized by integration.