JPS585888A - Symbol extracting device - Google Patents

Abstract

PURPOSE:To facilitate extraction of symbol characteristics by extracting only symbols and definitions from a drawing in which symbols and lines are mixed basing on large area structural analysis. CONSTITUTION:Output 40 of a buffer registers 39 enters input 42 of a buffer 41, and input 44 of a timing circuit 43. Output 65 of the timing circuit 43 is connected to input 68, 69 of counters 66, 67, and output 70 of a collation memory 61 is connected to input 71, 72 of counters 66, 67. Output 73, 74 of countr 65, 67 is connected to input 76, 77 of a coordinate point 75. Window data cut out by buffers 41, 46, 51 and registers 48, 53, 56 are compared with the contents of the collation memory 61. When coincide with characteristics extraction data, they are regarded as intersection point, and contents of the counter are stored in a coordinate point memory 75.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a method for extracting only portions defined as singels from a drawing in which singels and line segments coexist.

Conventionally, each singel used in flowcharts, logic circuit diagrams, etc. is defined as a predetermined shape. Methods for extracting the symbols of the Fukey chart or logic circuit diagram written using the defined nine symbols include the gloss turn matching method and the feature extraction method.

In the /g turn matching method, the shape of a defined singel is registered in advance, the registered original shape is compared with the v/AWJ for extracting the singel, and when a match is made, that part is determined as a singel. was. q# Fine oil extraction method Extracting the singel From the drawing, the features that are thought to constitute the singel, such as the end points.

This method extracts points of inflection, intersections, etc., compares the extracted data with predefined features of nine shapes, and extracts shapes with matching features as singels. 'The four-turn matching method described above can reliably extract the thin part, but if the structure formed by the part of the thin part and the line segment coincidentally matches the pre-registered no f turn. This technique has the drawbacks of erroneously extracting the above-mentioned structure as a singel, and of having to register a new parable turn when dealing with drawings that have been enlarged or reduced. The feature extraction method provides criteria for features to be judged as a singel, and how to combine each feature to judge it as a singel.
Furthermore, in actual use, there were many difficult problems, such as how to compare each feature in a stable state.

The present invention is intended to solve the above-mentioned problems, and its purpose is to extract only parts defined as singels from a drawing in which singels and line segments coexist based on global structural analysis. The object of the present invention is to provide a singel extraction method.

The present invention is characterized by a plurality of single gels each consisting of a closed region, and a plurality of single gels having an angle of 0'' and 90 @ centered around the single single area.

180@, 270'', the nine drawings obtained by the input means and the drawing controller consisting of a group of straight lines connecting the singel and the part other than the singel, in which the thinning lines are parallel to each other in at least one of the four directions; means for converting data into aS; means for extracting intersections between singels and straight line groups of the thinned drawing data and intersections between lines of the straight line groups by window processing; and means for extracting the thinned drawing data by window processing.
- Means for extracting the evening closed region and dividing it into closed region units, and which closed region of the closed regions obtained by the means for extracting the closed region and dividing it into closed region units determines the intersection point extracted by the window processing. a means for extracting whether the
means for determining the connection relation between each closed region based on the nine data obtained by the means for extracting the closed region where the intersection points are formed; and means for determining the number of connections based on the relationship obtained by the means for determining the connection relation. means for determining that a region of 5 or more is not a singel; means for determining as a singel a region that is only connected to the region determined as not to be a singel by the determining means; and a point area that is determined to be not a singel. Among each closed region excluding the closed region determined to be a single 〇, a closed region that is combined with a single 〇 closed region is determined to be a singel, and further combined with the closed region determined to be a singel. Is there a way to determine that a closed region that is a closed region is not a Singel? O”, 90”, 180°, centering on Le
To provide a singel extraction device that extracts a singel's fist from a drawing constituted by a group of straight lines connecting the singels and the parts other than the singels in at least one of the four directions of 270''.

Hereinafter, the present invention will be explained in detail using examples of the present invention.

The present invention is not applicable to all single-gel extractions of drawings consisting of single dlAz and line segments, but rather multiple single-gels consisting of closed regions and cough singles centered around 0@, 9.
This is a method of extracting singels from a drawing consisting of a group of straight lines connecting the singels and the singels and parts other than the singels in at least one of the four directions: G", 180°, and 270@.

FIG. 1 is a flowchart that can be processed by the present invention. FIG. 2 is a diagram showing the connection direction of each singel. All symbols are closed loops, and all combinations of symbols with other symbols are 0'', to', 1
80., 270"12) direction.

FIG. 3 shows a processing flow of the thin line extraction method of the present invention. The processing of the present invention can be roughly divided into a preprocessing section, a region expression processing section, and a region classification processing section. In the preprocessing section, drawing data 1
perform line thinning process 2, and based on the result of the line thinning process, perform intersection extraction process 3 and area segmentation process ff14;
The region expression processing unit 2 performs a boundary extraction process 5 based on the results obtained by the preprocessing unit, that is, the results of the intersection extraction process I13 and the results of the area division process 4, and further extracts the boundary. The region segmentation processing unit performs the inter-region joining processing 6 using the result of the processing 5, and performs the judgment-1 processing 7 based on the result of the inter-region joining processing l16, and then performs the judgment-2.
Perform processing 8, Shin? Outputs file data 9.

The preprocessing section extracts the intersections of singels and line segments from the original drawing data, and divides the entire drawing into groups of closed regions with each closed region as a unit. Thinning process 2 is shown in Figure 4. Consists of arithmetic circuits. Input Vdeo terminal 10
is connected to the input 12 of the blue buffer 11. The output 13 of the buffer 11 is the output 15 of the buffer 14 and the register 1
The output 18 of 7714 goes into buffer 190 input 20 and register 210 input 22.

The output 23 of buffer 19 is input to input 25 of register 24. Output 2 of each register 16, 21.24
6, 27, 28 are dictionary memory 290 inputs 30.31.3
2, respectively.

The output 33 of the dictionary memory 29 is input to the output 3s of the buffer register 34, and the output 36 of the buffer register 34 is output as an output video. The thinning arithmetic circuit has a configuration based on the logic of a 3×3 window, and the original drawing data is first transferred to three buffers 11, 14.19 and three registers 16°21.24 in a 3×3 window. Cut out the window.

The above-mentioned cut 9 out 9 contents are converted according to the logic JIK in the dictionary memory.The above conversion is executed by a combination of ``same no parable turn'' and ``complement f → turn'', and slender no 1 turn is 110, that is, a pattern that changes black to white, and correction no-no-turn is a pattern that changes Otl, that is, white to black, and the window of 3 rows and 3 columns is compared with the pattern in the dictionary memory, and the output figure is converted depending on the case.

Figure 5 shows the data in window 31 and the dictionary memine IJK.
The correspondence relationship between each stored pattern and the data 38 is shown. FIG. 6 shows a generally used collation order.

The input data is CtJTl, Cυ〒2, CUT
l, CUT2゜CUT3, CUT4, C1
J↑3, CUT4, PADI, CUT3
.

CUT4, PAD2, PAD3, PAD4
# In the 6111 table that is checked against the PAD5, each CU
Dictionary Δ of T1 to CU'r4, PADI to PAD5
This is an example of turn t'' expressed in two hexadecimal digits. Table 1 “Narrow/Main turn” ■CIJT 1 28#09#29.60, 68#69, 0!1,2B,
6B, C010118, [9°11#DO, FO, F8
．． Fe2O2,6FIF,94. D4. F4. FC,F
D.

9＠ ■CIJT2 29.419,03. OB, 2B, 1iiO, 90, 0
0,06,07,OF,2F,14°16t17. IF
, 3F, 94#D4.96.97.9F, BP, D6.
F6. D7゜F7゜■Country! 3 29.68.69.011#211,6B, 1c018
．． [9, IB, DO, FO, F8°F9#07.6F,
IF#94. D4. ? 4. iFc, FD, 9G■CUT
4! 9.69. OB4!1. go, do, 07.01P,
2F, 16.17. IF, 3F.

94eD4.9L97.9LilLD6.1LD7.7
7゜ "Correction/# Main" ■PAD 1 48.49.4mm #4B-CIIeCesCA, CB-
50#70-58.78,51-71.59,79,5
2.72, 5mm, 7mm #53.73t5B17B, 08
．． D9゜DA#DB#4Ce4D#41C, 4F, CC
, CD, C11i, CF, 54,7415C.

7C, 55, 75, 50, 7D#56.70.5g, 7
57, 77.5F, 7F.

DC, DD#Dii, DF ■PAD Dew ■Pmu D4OA, 2
A, O1,2m 12.13.92.9
3■PAD 3 ■PAD 5
50.7G, 54.74 48.49. C
8.C9 Dictionary/All-turn intersection extraction processing is performed by cutting the above-mentioned data t into a 3×3 window and comparing the window data with the logical condition indicating the intersection shown in Figure 7. It is done. Figures 1 and 8 are circuits representing the intersection extraction process ms1. The output 4o of the buffer register 39 is the input 42 of the buffer 41 and the input 44 of the tie construction circuit 43.
to go into. The output 45 of the para-fuch 41 is connected to the input 47 of the buffer 46 and the input 49 of the register 4s.The output 50 of the buffer 46 is connected to the input 52 of the para-fuch 510 and the register 5.
30 inputs connected for 54 km. Output 55 of buffer 51
is the input of register 56 57Km! It is threaded.

Register 48, 53.51! 5s for each way of I.

59.60 is input 62, 63°61C of collation memory 61
The output 65 of the main circuit 43 is input to the counter 6g, and the input 68° and 69 of $7 are connected to the matching memory 6.
The outputs o of 1 are connected to inputs 71 and 73 of counters 66 and 67, respectively. Counter 66.67 output cuff 3,
74 is connected to a coordinate point memory 750 people. pa y 7 y 41 e 4 fk m 51
1/') JCI 48 * 53 #56) The output 9-wind data is compared with the collation memory 10 contents, and if it matches the mold point extraction data as shown in Figure 7, the intersection point is set. Assuming that the contents of the counter [stored in the coordinate point memory 75], the area division process 114 is a process of dividing a closed area formed by the drawing data t thin line, thin line and 1 minute into units of each closed area t-1. be·
FIG. 9 shows a region division processing circuit, a label conversion circuit 780, a write output cuff G, and a buffer candy 81.8 of 80.
2 write input 83.84 IC battle memory 81.8
The two lead outputs 85 and 86 are connected to the read inputs 87 and 88 of the label conversion circuit 78, respectively. The label conversion circuit 780 control input 108 and status output 109 are further controlled by the control output 90 of the label conversion circuit control section 8-. Status human power 91 is connected. Label conversion (
b) The address control output 92 of the path 89 is the address control section 9.
3 input 94 is entered. The address output 95 of the address control unit 93 is the buffer memory 8111'20 address input 9.
Enter 6.97. Input/output terminal 9 of address detection circuit 98
9 is connected to the input/output terminal lOo of the pack memory 81. Control unit 1010 control terminals 102, 103.10
4 is an address detection circuit 980 control terminal 105. Label conversion circuit control section 920 control terminal 106. e g 91 each connected to the control terminal 107 of the address control section.
! At I, read sequentially from the horizontal direction along the thinned data pipe stored in the output memory 81. IIK of the read is an address that first changes from black to white, that is, from l to 0. Capture the value, and further capture the address value that changes from black, that is, from 0 to IK. Add a label that means a division of the area between the two changing address values, and add a label to the mat puff teme 8.
The data stored in the 0-order buffer memory 82Pg stored in 2 is read sequentially from the vertical direction along the column direction, and if a label indicating the division of the area between address values 0 to be converted to Zengji is displayed in one column. , a label tube indicating the division is given to the area between the addresses that change from black to white between the labels of the one column and the addresses that change from self to black, and the results are stored in the file memory 81. - The horizontal and vertical directions and labeling are repeated <9 times until the label area stops changing. - When the above-mentioned change disappears, the label area shows one closed area. After the one closed area is found and output, the process of labeling the screen data of the label area is changed to eliminate the state where the screen data changes from black to white, that is, from 1 to OK. figure.

The input drawing is shown in FIG. 10. In FIG. 10, rectangles are used for all explanations.

Figure 11 shows Kugata drawing 1 with 1 pre-processing process.
143 indicates a label of a closed region, and P2N2 indicates an intersection point.

The input drawing data is converted into labels for intersection points and closed regions by the preprocessing step 1111.The region expression processing unit uses the results of the previous step J611 to extract the connection state of each region, and converts the entire drawing into Yti-dimensional; Expressed as a string. In other words, the region expression processing section performs processing to see the structure of each surface called a region into simple connections between numerical values.Since the intersection obtained by the above preprocessing is on the boundary of the region surface, it is necessary to extract the boundary. Based on the result, the joint tube of the area surface is extracted by the inter-region joining process 6. ・11112WJ indicates the extraction process m circuit of the boundary extraction process S. ・Input/output terminal 111a control circuit 1 of the coordinate point M peak 75
It is connected to 12 input/output terminals 113.

Outputs 114, 115 of control path 112 are connected to address control circuit 116. It is connected to area table memory 117. The output 118 of the address control circuit 116 is stored in a buffer 119. It is connected to the area search engine 117 via the label search circuit 120.

The control circuit 112 reads the intersection atris data stored in the coordinate point map 79 of the intersection extraction circuit shown in FIG. 8, and outputs it to the address control circuit 116. The address control 1 path 116 cuts out drawing data t3×3, which is thinned and labeled, which is stored in the buffer storage 119 as the center of the address data tube, and outputs it to the label search circuit 120. Label search circuit 1
At step 20, the labels existing within the small window are stored in the search area table memory 117. The series of processes described above are performed for all data stored in the coordinate point memory, that is, for all intersection points.

Table 2 shows the results of one boundary extraction of the intersection point and closed region data shown in FIG. 11.

No: 500 intersection RIEIi8: area table 117
The address \tLINKAGE indicates a connection of closed regions.

The connection process 6 between areas is based on the IJN of the area table 117.
The contents of the KAG1 portion are searched to determine the relationship 1 between each area and other areas connected to it. For example, region R5 connects regions R1 and R3 at intersection P5, and -blAc region R at intersection P8.
3. Since it is in contact with regions R1 and R8 at the intersection pH with R8, the binding label of region R5, that is, the binding region is R1.
, R3, and R8. FIG. 13 shows a circuit configuration for connection processing between regions.

Label generation circuit 121 is connected to control section 122 . The area table 123 is connected to the address detection circuit 124.The output 125 of the control section is connected to the address detection circuit 124 and 2.
It is input to the input 128 of the combination table 127 through the bell detection circuit 126t. The label generation circuit 121 sequentially generates intersection numbers according to instructions from the control section 122 and outputs them to the control section 122. Control W5122 communicates the number of the intersection to address detection (b) path 124. The address detection circuit 124 sends the combined data of the closed area of the area table 123 to the label detection circuit 1 through the address detection circuit 124.
Output to 26. The label detection circuit 126 stores the combined labels of the three connected closed regions in the combined table 127. lI [3! ! l! 2 shows the result of performing a join process between regions based on the data of the region table shown in Table 2.

The area classification process is based on the connections between the areas and the number of connections described above, based on the connections between the areas and the number of connections, and finally, extracts only the regions that mean singel.The judgment of whether each region is singel is made based on two advantageous logics. One of the above judgments is based on the rule of connection direction of Shingel (4 directions of 0, 90°, 180°, 270° with Shingel as the center); -1 processing is performed. One of the above-mentioned judgments is determined based on the state of connection between regions), and is performed in judgment 2-2 processing.

e4 啼I6 groan cQ to Korean n1 rumors groan N~ to heeeee oP4 to n pus ψ to ■ Φ 0 - ~ use 1 φ to ψ [phase] to low eJ 〜 he package to ~ 伽 (12Fl evil n no's hanhan n's 啼 groaning review - Ichinoseki Acupuncture Acupuncture 1Seki 1 review 11SekiSekiView 1Seki 11 Judgment - Depending on the number of connections each area of the join table joins in one process, the In other words, it is determined that the area of 5 or more from the number of connections is not simple.

Diagram 14 shows a block diagram of the judgment-1 process, and the output of the join table 130 is input to 7γ131.

The output of buffer y1.31 is connected to subtracter 132.

The outputs 134 and 135 of the control unit 133 are the connection table 13
0 and the subtracter 132. The positive output 136 of the subtraction 1S 132 is connected to the flag generation 137, and the negative output 138 is connected to the Fi control section. The control unit 133 sequentially outputs the number of connections in each area of the connection table to the buffer. The P and F 131ri output the connected side number to the subtracter 132, and in the subtraction -132, the data inputted from the control unit, that is, "
4# is compared with the input number of regions, and if the number of regions is greater than 4, a negative output 138 tells the control section to input the next number of regions. When a positive signal is input to the flag generation 137, the flag generation 137 erases the connection label in the connection table and writes non-symbol information.

The queen motion is repeated for the number of regions.Table R4 shows the results of judgment-1 and 11 based on the connection table in Table 3. In Table 4, "@NO, 8YMBOL" is a label indicating that it is not thin.

Judgment-2 processing IIIFi is a process of extracting a closed region meaning a symbol using the result of the judgment-1 processing), the first
The condition of #I2 is ``The area meant by the symbol Ik is surrounded by areas that are not symbols.''
The processing is performed using two conditions: 1. Two regions cannot both be thin.

FIG. 15 shows a circuit configuration for determining a thin line using the first condition. The outputs of the join table 130 enter the address space 139, the address space 140 and the link buffer 141. 1st
Loon 222 in Figure 5(a). The output of the page 140 is connected to the rough page memory 142 . Links 1. The output of the first page enters the second page memory 142 via the comparator 143. The control unit 144 is connected to the combination table and the comparator 143. [The join table 130 in FIG. 15(b) is compared via the link buffer 145! 1146 input.

The control unit 147 has a connection table 130 and a memory 1
Followed by @42. Buffer memo! 7142 (D output is output to comparison 1!146. Comparator ON output 148
is input to the input 150 of the COF 71% 149, and the OFF output 151riACC of the comparator 152 (enters the D input 153.0077% is input to the input 150 of the 149.
5 is input 157 of count 156 and data table 15
Enter input 159 of 8. Output 16 of mu cc memory 152
0.161tl Enters the input 183 of the counter 7162 and the input 16 of the data table 158. Karan) 156.1
62 respective outputs 165, 166 are connected to inputs 167, 168 of the H data table 158, respectively.

In FIG. 15(a), processing is performed to store in the memory 142 the seven lag data of an area whose contents are expressed as not being thin in the area of the join table 130. In figure (b), the join table 130
The content of the data is extracted in the order of the labels, and the extracted data is compared with the content of ADD-1 of the buffer memory 142, and those that match and those that do not match are separated. Furthermore, the number of data stored in the MCC memory and COF memory is calculated, and data of C0FN-00 is extracted. The extracted closed region is thin.

Table WJ5 shows the judgment table (4) obtained using the join table shown in Table 4 and the judgment result (B). ACCN Indicates the number of connections with closed regions where the U syn is not Ru. In the judgment result 俤), "NO" indicates that the thin line is not true, and "@8M" indicates that the thin line is true.

FIG. 16 illustrates the determination results shown in Fi1g5%. In the above judgment result, closed regions R3°R5, R9
, R13, R16, R18, R20°R21, R23,
R26, R27, R28, R31゜R32, R35, R
36 are undecided. The second condition, ie, ``two regions that are connected to each other cannot both have a thin line'' is used to determine the thin line of the undetermined closed area.

- Sphere Mv + aφh @ 11 [phase] Oe-1# #) Drop - 轡To false @ - e1m N N N 18 N N M M 2
1-^^-e s s w vS*aaSekiSeki Acupuncture-Ichinoseki 11111 111Peng10600 -0eloφ
RororooOΦ--~ Oath Q Oath-W u %j Oath! Oath Q oath! Qsu9QwaQQm
g+4eQ trout @1! ψKorea ψ! −Φ to nηn~
Sanichishima Shun 00ku O-066ψ Roro 0 Roro ψ--~ --m-Sen F-w4 v-4y4-
NguchiOO00In # 66066660a Rumor
fi-la)1
0-~ To ω0 RoroOOOOOO N+-+ eflm NN On the verge of-~-Tsuruhan0shima-suke[phase]0 Roro+1 m (to +11 package To~Sen--Senkoku Ichipaku cQ
〜Sen nme shu sōzen bahe he wa shu ---value O Akebono ・η Koto f fi ('4 fi fi instant moment! ~ evil to N or - one - ^! moment ψto eoaso- even n! Rumor ψtψ [phase] 0 wheel H
e1l ~ member suke -me n -ryo --nishiki han
Han! Next, before proceeding with an explanation using an example, the logic for determining the sinusoidal number will be explained. For closed regions that cannot be determined by the process based on the first condition, the connection between regions is determined by 2.3.
4 and 5, 6 formed by their synthesis
, 7-... Hereinafter, the above numerical value will be referred to as the degree of coupling.

FIG. 17 shows examples of coupling degrees of 3.4, 5, and 6.7. Since it is determined that all the regions surrounding the group of closed regions are not thin, first, in each region, a region in which one closed region is connected to another single closed region is extracted. The extracted area can be determined to be thin because it is an area surrounded by a plurality of areas and an area that is clearly determined to be not thin. In other words, the closed region in which the content of C0FN in Table 5 is 1 corresponds to the closed region.

As a result of the above processing, the coupling degree in FIG. 17 is 3 for FiR'1 and R'5, 6 for R'1 and R'5, and R'6.
0 where l, R'2, R'6 and R'7 are judged to be thin.
Next, it is determined that the closed region that is connected to the closed region determined to be thin &A is not thin I. According to the above judgment, all the connectivity degrees 3 to 4Fi are processed or determined, but only a part of the closed region group is determined for the others. However, since the unprocessed region is a superimposed form of configurations having basic connectivity IL, By carrying out the above process mt, it is possible to determine the thin line of the fully closed region.

FIG. 18 (- indicates the result of the judgment-1 process, that is, a closed region determined to be more similar to C0FN-1 using FIG. 16).
Indicates the result of determining that the closed region where Shin is connected to Ru, determined by a), is not Shin. Indicates the determined result.

FIG. 19 shows a circuit configuration for determining that the area is thin using the 20th condition, that is, ``two areas that are connected to each other cannot both be thin.''

The output of the data table 158 in FIG. 19 (1) is C0F.
IN/dish, enter the input 171 of the border 170. C0FN
/f, the output 172 of the 7th 17G is the input 1 of the comparator 173
Enter 71.

Comparison 1!1780 output 17S#i Shin is connected to Luarada generation 1780 human power 177. Output 1711t data of S/nur 7r Shengwei 116 Input 17 of Cheagle Zheng
Enter 8. Control unit 1800 control output 181 is comparison 1B1
73, Shin generates Rutsurada 1 floor, data chi 2 kll
1 for each control input of i8 182°183.114
Continuous. The control unit 1800 control terminal 1811 is connected to the data table 1! Connected to the SIO control terminal 186,
191) data tape A 11! 8 output 18
7.1118 is Sinurfuradapakhte 188 respectively
* is inserted into the input 111 of , and the input 191 of the C0FN buffer 190 . 111j Gobe 19! The control terminal 193 of the address 2. It is connected to the control terminal 19 of the frame 194 and the control terminal 196 of the data team 1s8. Shin? The output 197 of the Lufrada t427-188 goes into one input 199 of the comparator 198, and the output 199#i of the comparator 5198
/4, memory 200C) enters one input 201.

An output 202a of the address pad 194 is connected to the other input 203 of the border memory. Control output 2 of control unit
04 is connected to the control input terminals 205 and 206 of the comparison @198 and the buffer memory 1720G, respectively. Comparison *201t) Input 208, 208 has Buffte memory zooo output 210 and C0FN pa, output 2 of 7-190
11 are respectively input. Output 21 snow of comparison 5207 is data team 1 file 1 via yy-ruarada generation 213
58 input 213.

In FIG. 19(a), the contents of C0FN are read from data chip 7k1511], and the read data is
0IFN/4. It is stored at the edge 170. Comparison circuit 173
Then, the C0FNdy7tel 'I OK stored 〇〇FN data is read out and compared with the signal representing the numerical value it at a certain timing according to the command from the control section 180, and if they match, it is outputted to the output 175. The signal flag generation 176 generates a flag (1 for presence, 0 for absence) indicating that it is a signal every time it receives the signal when a match is output from the comparison circuit 173, and generates a flag (1 for presence, 0 for absence), and Output to file 15.8 (*WJ), read the bladder from the data cheat 1511 to each address.
7 F Shix
Store the 7 dress value in 2000 ADD8, which is the address of 7 characters. Furthermore, data til! from data team 158 to C0FN! Compare the contents read from the tablet with the data stored in the ADD 8 of the /#Tsufame 200.

If the above comparison matches, it means that the syn is not Ru 79! It is generated by the generation 213 and stored in the area of the address at the time of the match in the data table 15g, and the area connected to the thin rule by the above operation is determined to be not a thin rule. Furthermore, the Shin in Figure 19 (11) is Schiff 2121 Fd 1
881-Change to the generation of 213t Shin to 7 Ladder generation, and perform the same operation 11 as the above 9.
The residual region formed by combining the basic degrees of connectivity is determined to be thin.

The above is about the thin-kIII extraction method of the present invention that can extract only the portions defined as thin from a drawing in which thin lines and line segments coexist based on a global structural analysis using flowcharts and circuit configuration tubes. Detailed explanation [Done.

A simple explanation of the iris iml is a diagram showing the 7g1-chart, Figure 2 is a diagram showing the Shinru O Sosha Hangang, jlF3 diagram is a diagram showing the processing method of the present invention, and 411 is a thinning line. Plotter diagram showing the arithmetic circuit of! The IEs diagram is a diagram showing the expression of the dictionary, the 61st diagram is a diagram showing the query logic, the 7th WA is a diagram showing the feature point extraction data, and the FIG. 8 is a diagram showing the feature point extraction circuit. Kaku, Iris - Kaku is a vine diagram showing the #l & 311 circuit of area division, No.
og is a diagram showing the input drawing, No. 1111 is a diagram showing the result of the previous 4611, FIG. 12 is data showing the boundary extraction circuit, l
1, 13th I11 is a professional diagram showing the 46110gm road configuration between regions, and Figure 14 is a professional diagram showing the judgment-11&NO configuration, l1, 1511t! ＃(b) ＃←) is Flowchart showing Judgment-2# & Luck results, No. ←), 佽) is a diagram showing the circuit configuration of Judgment-2 escape.

2... Thinning am, s-... Intersection O extraction process, 4...
・Region division #11m1.5-Purity of boundary extraction, 6-・
・Connection processing between regions, 7... Judgment -1 Gitaki, 8...
Judgment-2II & Ri, 9- and Shin I data.

Claims (1)

[Claims] A plurality of singels consisting of closed regions and four angles of 0", 9G", 18G", and 270 degrees centering on the mosquito sinules
means for inputting, in at least one direction, a drawing consisting of a group of straight lines connecting the line and the line connecting the line and parts other than the line; 1. Means for extracting intersections between singels and groups of straight lines in the refined drawing data and intersections between groups of straight lines by win processing; extracting closed regions of the IIAiI drawing data; The intersection point extracted by the means for dividing into closed region units and the window processing is obtained by the means for extracting the closed region and dividing into closed region units. a means for extracting whether the area is constituted by a region;
means for determining a connection relationship between each closed region based on the data obtained by the means for extracting a closed region where the intersection points are formed; and connection based on the relationship obtained by the means for determining the connection relationship. means for determining that a region having a number of 5 or more is not a singel; and means for determining that a region that is connected only to a region for which it is determined by the determining means that the singe does not spread as a singel is a singel; Among each closed region excluding the closed region determined to be not a singel and the closed region determined to be a singel, a closed region that is connected to a single 〇 closed region is determined to be a singel, and further This is a means of determining that a closed region that is determined to be a single closed region and is connected to a nine closed region is not a singel], and 0@, 90 degrees around a plurality of singels and a scissor singel consisting of closed regions. Shingel extraction characterized in that only Shin Ik is extracted from a drawing consisting of the straight line group connecting the Shinga Ru line and the Shinga Ru line and the part other than the Shinga Ru in at least one direction among 18G@, 270.04 directions. Device.