JPS60142483A - Method for connecting between unconnected terminal points of linear pattern vector - Google Patents

Abstract

PURPOSE:To reduce disconnection as much as possible and to remove troubles to be applied to the succeeding processing an much as possible by connecting between unconnected terminal points only when these terminal points are used as candidate points of connections each other to connect a disconnected vector. CONSTITUTION:An unconnected terminal point extracting part 1 receiving vector data extracts all unconnected terminal points or unconnected terminal points within a prescribed area by using the vector data, finds out the terminal point Nos., forms an unconnected terminal point list, and sends the list to an intra-terminal point connection appreciating point 4. The appreciation part 4 determines a table for specifying the terminal point No. of one terminal point (A1) among unconnected terminal points in the unconnected terminal point list inputted from an appreciation table in a memory 5. On the basis of said determined table, whether available combination between the terminal No. of the other unconnected terminal point (B1) and the terminal point No. of the terminal point on the A1 side when it is supposed that a vector is generated between the terminal points A1 and B1 exists or not is checked. The connection candidate point data obtained by said procedure are sent to a connection vector generating part 8.

Description

Detailed Description of the Invention (a) Technical Field of the Invention The present invention relates to the force formula between unconnected points Ml1m (■h) of a line figure vector, and in particular selects connection candidate points from a pair of unconnected end points, and calculates the connection f 1111 points-to-point connection method (connecting the candidate points between the -sode point and the j- point and unconnecting the hectors of the line diagram).

(0) Technology background 1i1ii f8! In processing line figures, such as recognition of 1y1 shapes, a technique in which the drawing in which the line figure is drawn is read with a scanner, dot data is obtained, and then the dot data is converted into hexagonal data. is used. Lines converted into vectors using this technique are lines of line drawings drawn due to the shading of the figure, blurring during reading, or the presence of iJl portions of colors in figures written in multiple colors. is not a faithful vector, and a disconnection occurs.

A 111 line like this will interfere with subsequent processing, so
Before starting the process, it is necessary to connect the lli line.

(c) Purpose of the Invention The present invention was devised in response to the technical problem of connecting one line to the other, and the first objective is to reduce the number of disconnections as much as possible by connecting the 1tJi line to the 1tJi line. The object of the present invention is to provide a connection force equation between 111 unconnected points of a line figure vector that can reduce the trouble caused to subsequent processing by JJl as much as possible.

(C) Structure of the Invention In order to achieve this object, the first method of the present invention includes an unconnected end point extraction unit that extracts unconnected end points from vector data about input linear figure lines, and a connection candidate point selection unit that evaluates the possibility of connection for each pair of predetermined unconnected end points based on their mutual relationship and selects a connection candidate point for each unconnected end point; and a connection candidate end point that is finally set as a connection candidate end point. The second method is to connect unconnected end points by generating new vector data for connecting the lines.・An unconnected end point extraction unit that extracts unconnected end points from the data, and evaluates the possibility of connection for each pair of extracted predetermined unconnected end points from the phase r1 relationship and selects connection candidate points for each unconnected end point. a connection vector generation section that generates new vector data connecting the connection candidate points set as connection candidate points; The apparatus is configured to connect unconnected end points by repeating the processing of each section described above for vector data.

(E) Embodiments of the Invention The present invention will now be described in detail with reference to the accompanying drawings.

FIG. 1 shows an embodiment of the invention. Considering this diagram,
Reference numeral 1 denotes an unconnected end point extraction unit, whose human power 2 is given all hexagonal data obtained from the line figure line, and its output 3 produces unconnected end point data. 4 receives the unconnected end point data and evaluates the connected IJJ while proceeding with the processing between the BJ, the evaluation table memory 5 and the rangefinder Sakaki part (+lli and unconnected %, °1j, for each point 8 is an inter-end point connection evaluation unit that selects a connection candidate point and sends it to the output terminal. 8 is an end point-to-end point connection evaluation unit that selects a connection candidate point and sends it to the output terminal. 8 is an end point-to-end point connection evaluation unit that selects a connection candidate point and sends it to the output port. This is a connection vector generating section that newly generates vector data for connecting the vectors and sends it to its output 9.

Next, the present invention configured as described above will be explained in detail.

Line figure hector data is given to the unconnected end point extractor 1 via human power 2. The data was generated as follows. That is, the line is O'' with respect to the X axis, 45
°, 90' + 135'', and the above four types of i'
Those within the range of ±22.5° relative to IJi are
It is treated as belonging to one of the four types of inclinations listed below. Then, line end point numbers are given as shown in FIG. 2 according to the slope of the line and which side of the line the end points are on, and the coordinates of both end points of the vectorized line are given as follows.゛When converting into vectors (X+, y+) (X2. y2)
Vector 2 = (Xs, y3) - (X4, y4)"
(
xi +' y + '), those that appear more than once means that the endpoints of the vector are connected to other vectors, and the coordinates that appear only once are unconnected i>
1i means 1 point. So, as mentioned above.)
The unconnected end point extracting unit 1, which has received the vector data TJ, uses the hetator data to extract all "C" unconnected end points or the unconnected 1'71i1 points within a predetermined area, and extracts one end point number. Create the following unconnected endpoint list and send it to the endpoint indirect statistics (illill).

Unconnected endpoint list endpoint coordinates Endpoint? 11=Month (xk, yb) End point indirect statistics (+1i Rli 4 requires processing with the evaluation table memory 5 as described above, but the table is prepared in advance as follows. The unconnected end point Δ and the other unconnected end point 1 are created.
If a vector is generated between 3 and tel, take the unconnected end point △ for this vector and
End point number silk t7. r matching - d ((, 1, 1, and the vector data is generated as described above) becomes 5xsxa-siz nail η. Then, if the unconnected end point A is a specific end point analogy, When the end point is fixed to the end point numbered 1 as in a double series, there are 8 x 8 combinations of end point numbers to take ζ i′ for the unconnected end point Δ. Due to the nature of line shapes and the nature of disconnections due to blurring, this occurs due to the relationship between a line connecting two points and a line extending on both sides of the two points (11) Considering the case where there is no line, the following conditions (for example) ), ], a line never runs on the same line twice.

2. Lines do not form acute angles.

3. The slope of the line drawn between the end points matches the slope of at least one of the lines extending from both ends.

Given, when the unconnected end point Δ is fixed to the specific end point 1, the unconnected end point A is ζ (take θ111) The combination of point numbers becomes nine cases as shown in FIG. The connection table below is a tabular representation of this relationship.

In the above table, [3 is the end point number of 0111 point B flIl+, and A is the end point A when a vector is generated between ΔB.
is the end point number, ○ indicates a possible combination, ×
The mark indicates that the combination does not meet the U condition.

A table similar to the above table is similarly created and stored for end point numbers 2 to 8 to one anchor point in the 4Illi chief memory 5.

This i/1 value table in the memory 5 is used in the point-to-point connecting needle value unit 4 to use the α111 point of the unconnected end points in the input unconnected point list (this is set as Δ).

shall be. ), one of the eight tables is determined from the endpoint number. Using that table, we can determine the possible combinations (0 Test 6 times to see if there is a mark).

Between unconnected end points that can be this possible combination (/'z
(between B+) (7) Distance MIlwotI'l! M11 plan fraud R1
(6-te calculation 1-le.

Conversely, if the possible combination -U is true, the process proceeds to the next unconnected 1 point 111 point 132.

In this way, end point A is fixed, and the shortest distance between it and end point B, which can be a possible silk combination, is determined as the connection candidate point for unconnected end point A. .

Such processing is continued until all unconnected 4*ill:1 points are reached.

The connection candidate point data determined in this way is sent to the connection point generation unit 8, which generates a new connection point data that connects the connection candidate points that are each other as a connection candidate point on the other side of the connection candidate point data. It is output from the connection vector generator 8.

This process connects the disconnected vectors. be able to.

However, if unconnected end points are densely packed, they may not become connection candidate points for each other.

For example, as shown in FIG. 4, A1 is Ci, B1 is A
1, C0 may use Dl, and Dl may use CI as a connection candidate point. In this case, a heckle is created between Ci and 1) +, but both A+ and B+ remain as unconnected end points. In such a case, if the series of processes described above are repeated from the beginning for the line figure vector data including the newly generated vector data, Ai
, Bi can be connected. In this way, the number of unconnected endpoints can be reduced.

Note that in the above embodiment, connection candidate points are selected taking into consideration the distance all between the end points evaluated in evaluation 1iii and the slope of the vector extending from both end points, but the selection is not limited to this. .

(f) Effects of the Invention As is clear from the above description, according to the present invention, ■ Connections between pairs of unconnected end points are made only when each other is used as connection candidate points, so that the occurrence of erroneous connections is prevented. - The number of unconnected end points can be reduced by repeating the connection process. - The desired purpose can be achieved with simple processes such as table reference, distance & 1 [calculation, comparison, etc.] The effect of this can be obtained.

[Brief explanation of the drawing]

Figure 1 is a diagram showing an embodiment of the present invention, Figure 2 is a diagram illustrating constraints when vectorizing a line, and Figure 3 is an example of creating a table used in the present invention. figure,
FIG. 4 is a diagram illustrating a problem that occurs when unconnected end points are crowded together. In the figure, 1 is an unconnected end point extraction section, 4 is an inter-end point connection IF value section 1b, which is a table memory for ii't' values, 6 is a distance calculation section, and 8 is a connection hackle generation section 8B. Figure 1 Figure 2 Figure 31/Figure 4

Claims (1)

[Scope of Claims] (1) An unconnected end point extraction unit that extracts unconnected end points from vector data regarding input linear figure lines;
a connection candidate point selection unit that evaluates whether connection is possible or not based on the mutual relationship of each pair of one point with a predetermined unconnected width, and selects a connection candidate point as an unconnected, +, or IM point; Connect the connection candidate points and connect them as candidate points.
1. A method for connecting unconnected end points of a hexagonal hexagonal diagram, characterized in that it is equipped with a connection and a vector generation unit that newly generates a torque take, and connects unconnected 11θ1111 points. f2+ -1 notation hlli is a total of 1i11i unconnected width) 11 "1 information)l between the points) and the inclination of hectares extending from the two points) is taken as T1♙ sign. Claim No. 1 "The line described in r] The connection force between the unconnected end points of the Z1 type-\R1-R (3) From the data regarding the input line figure line. an unconnected end point extraction unit that extracts unconnected end points;
A connection candidate point selection unit that evaluates the possibility of connection for each pair of predetermined extracted unconnected end points based on their mutual relationship and selects connection candidate points between the unconnected end points, and connection candidate points that consider each other as connection candidate points. a connecting hackle generator for generating new vector data for connecting between the lines; (4) The above evaluation is based on the distance between the evaluated unconnected end points and the two end points. A connecting force equation between unconnected end points of a line figure vector according to claim 3, characterized in that the equation is made using the slope of the extending vector.