JPH03228192A - Node matching processing system - Google Patents

Abstract

PURPOSE:To perform the node matching processing at a high speed by checking whether the Y coordinate value of the node which has an X coordinate value within an allowable error range from the coordinate value of a connection object node in a fast coordinate table where X coordinate values are sorted in the ascending order is within the allowable error range or not. CONSTITUTION:Nodes are searched which have coordinate values within the allowable error range from the coordinate value of the connection object node in the fast coordinate table, where coordinate values stored in an X or Y coordinate table are sorted in the ascending order and are stored, and have coordinate values within the allowable error range from the coordinate value of the connection object node in the coordinate table which is not stored in the fast coordinate table. X and Y coordinate values of the connection object node are changed to those of the node to which the distance is shortest. Thus, the node matching processing is performed in a shorter processing time, and the processing time is not extended with respect to an exponential function though the number of nodes is increased.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to map processing, and particularly to a node matching processing method for connecting arc nodes that are unconnected due to manual input errors.

[Conventional technology]

In map processing, when connecting nodes that are the start and end points of an arc, which is a line element of the map, the nodes of the arc manually input using a digitizer etc., although they originally have the same coordinate values, As shown in the figure, depending on the input error, nodes a, b, - of arcs A', B, C, D
, i, the connected pair nodes a, q, b, C, and e
, d and '', the coordinate values are different. When node matching is performed for nodes with different coordinate values, a tolerance γ is given and the process is performed to connect to the closest node included within γ. For example, if we focus on node b, the nodes included in the tolerance γ centered on b are C and e, and the one with the smallest distance between c and e is C
Therefore, the node b is first connected to the node e. Next, when node matching is performed on the node C, it is similarly connected to the node e(-b), and as shown in Figure 5, the nodes b and C match the coordinates of the node e. Replaced by value.

Conventionally, this type of node matching processing method has been a method in which nodes are stored in a node table and all other nodes are searched for one node to connect the nodes.

[Problem to be solved by the invention]

The conventional node matching processing method described above is a processing method that determines the connection target node by 9-folding all nodes for one node in the node table, so as the number of nodes increases, it becomes exponential The disadvantage is that the processing time increases.

An object of the present invention is to provide a node matching processing method in which processing time does not increase exponentially even when the number of nodes increases.

(Means for Solving the Problems) The node matching processing method of the present invention corresponds to an X-coordinate table in which the X-coordinate values of connected nodes are stored, and a node table consisting of a serial number table storing sequence numbers corresponding to the X and Y coordinate values of each node; A high-speed coordinate table in which the coordinate values stored in the X-coordinate table or Y-coordinate table are sorted and stored in ascending order, and the sequence numbers stored in the serial number table in the node table are a table conversion processing unit that creates a high-speed search table from a high-speed sequential number table that is sorted and stored according to the stored coordinate values; A coordinate value is not stored in the high-speed coordinate table corresponding to the sequence number in the serial number table in the node table that has the same number as the sequence number in the high-speed serial number table corresponding to the coordinate value within the error range. Among the nodes whose coordinate values in the coordinate table or the XIF! reference table are within the tolerance range from the coordinate values of the connection target node, the node whose distance from the connection target node is within the tolerance range and is the minimum. a node matching processing unit that detects an X-coordinate value and a Y-coordinate value, and changes the coordinate value of the connection target node on the X-coordinate-1-pull and X-coordinate table to the X-coordinate value and Y-coordinate value, respectively; has.

〔credit〕

The connection pair of the coordinate table that has a coordinate value within the permissible error range from the coordinate value of the connection target node in the high-speed coordinate table in which the coordinate values are sorted and stored in ascending order, and that is not stored in the high-speed coordinate table. A search is made for a node with a coordinate value within the tolerance range from the coordinate value of the image node, and the X and Y coordinate values of the connection target node are changed to the coordinate values of the node with the smallest distance among them. Compared to the conventional method of searching and connecting all other nodes to one node stored in a node table, node matching processing is performed in much less processing time, and the number of nodes increases. However, although the processing time increases proportionally, it does not increase exponentially as in the conventional method.

〔Example〕

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the node matching processing method of the present invention, FIG. 2 is a diagram showing the configuration of the node table 1 in FIG. 1, and FIG. FIG. 4 is a diagram showing the configuration of Table 3, FIG. 4 is a diagram showing node connection target arcs in the node matching processing method of FIG. 1, and FIG. 5 is a diagram showing the node matching processing results of the arcs in FIG. 4. .

This node matching processing method is composed of a node table 1, a table conversion processing section 2, and a node matching processing section 4. As shown in FIG. 2, the node table 1 is composed of an X coordinate table 11, a Y coordinate table 12, and a serial number table 13. Arc A, B, C
,... nodes a, b, c, -... x coordinates 11iX
a, Xb.

For each arc, the X coordinate values of the nodes at both ends of Xc,... are Xi, Xk,..., Xb, Xa,...
They are read out and stored in pairs in the order in which they are stored in a database file (not shown).

Similar to the X coordinate table 11, the Y coordinate table 12 stores the Y coordinate values of nodes read from the database file in pairs such as Y, Xk, ..., Yb, Ya, .... has been done. Here, the X coordinate values XY, Xk, . . . and the Y coordinate values Yi, Yk.

. . . correspond to the same node i by the coordinate values of . The serial number table 13 contains coordinate values Xi, Xk, ..., Xb, Xa, ... of the X coordinate table.
...and the coordinate values of the Y coordinate daple Y^, Yk, ...
, Yb.

Sequence number 1 with 1 corresponding to each of Ya,...
゜2,..., Sb, Sa,... are stored. The table converter 2 converts X out of the node table 1
Coordinate values Xi, Xk, -=, Xb, X of the coordinate table 11
a.

... are sorted in order of stomach and shown in Figure 3 [..., Xa,
. . . At this time, the table converter 2
is the sequence number 1 that was grounded in the serial number table 13
,2. ..., Sb, Sa, ... are coordinate values 1 of the X coordinate table 11 stored in the high-speed external target table 31.
-..., Xa,..., Xf,...''
. . Sa, . . . , Sf, . The high-speed coordinate table 31 and the high-speed serial number table 32 are collectively referred to as a high-speed search table 3. The node matching processing unit 4 performs a node matching process on the nodes whose coordinate values are stored in the high-speed search table 3 in the order in which the coordinate values are stored, starting from the top. Here, if we take the processing for node b to the arc as an example, the X coordinate value of node b is Xb, and if the allowable error is γ, then in the high speed coordinate table 31 of FIG. It is sufficient to check nodes having coordinate values between α and β as β, and nodes with coordinate values outside this range are outside the allowable error range and are therefore excluded from the target. It is also necessary to check whether the Y coordinate value of a node with an X coordinate value in the range from α to β is within the tolerance range, and for node b, Yb−γ
A node with a coordinate value between Yb + γ and Yb + γ can be a node matching target. Now, taking the coordinate value Xh as an example, the sequence number in the high-speed serial number table 32 corresponding to Xh is Sh, and the sequence number in the Y coordinate table 12 corresponding to the status number Sh in the serial number table 13 in the node table 1 is Noza e! The l value Yh is within the permissible error range, that is, Yb
Check whether the value is between -γ and Yb1γ. α of the high-speed coordinate table 31.

Node e with other coordinate values Xe, Xj, Xc between 3,
The same process is performed for j and c, and X.

Notes whose Y coordinate values are both within the allowable error range are nodes C and e, and among these nodes C and e, node e whose distance is less than or equal to r and is the smallest is detected. Finally, the coordinate value Xb of the X-coordinate table 11 and the coordinate value Yb of the Y-coordinate table 12 in the node table 1 are serially numbered into the table 1.
The X coordinate value Xe and the Y coordinate value Ye are changed to correspond to the sequence number Se of 3. This means that node b is connected to node e. The node matching processing unit 2
The above processing is performed for all nodes a, b in the high-speed search table 3,
Let's do this for c,...

In the node matching processing method of this embodiment, a high-speed search table 3 is created, of which a high-speed coordinate table 31 is created.
For a node with X-value I within the tolerance range of Y
All you have to do is check whether the coordinate values are within the allowable error range, so depending on the arc shape of the map and the thickness of the allowable error value, you can usually search for about 10 nodes. I'm done. In the conventional method, it was necessary to check all other nodes for one node.If the reach time for one item in the c1 table is t, the processing time for a node number of 100C is: Processing time in the conventional method - 1000x 1000x t =
Although it is 1,000,000t, in this example, as mentioned above, 1
Assuming that the number of nodes to be checked is 10, the processing time of this embodiment becomes -10x 1000x becomes -1ooooot, and the speedup rate of processing time according to this embodiment is as follows.

〔Effect of the invention〕

As explained above, the present invention can be applied to the seat e! ! The values are sorted in ascending order and stored in a high-speed coordinate table, and the coordinate values that have coordinate values within a tolerance range from the coordinate values of the connection target node in the high-speed coordinate table and that are not stored in the high-speed coordinate table Search for a node with a coordinate value within the tolerance range from the coordinate value of the connection target node using the coordinate table in which is stored, and select the coordinate value of the node with the minimum distance among the nodes. By changing the coordinate values of the connection target node, node matching processing can be performed in much less processing time than the conventional method of searching all other nodes for one node, and the number of nodes can be reduced. Even if the number of nodes increases, the processing time increases proportionally, but does not increase exponentially. This has the effect of enabling high-speed processing even in map processing where the number of nodes reaches an enormous number.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an embodiment of the node matching processing method of the present invention, FIG. 2 is a diagram showing the configuration of the node table 1 in FIG. 1, and FIG. 3 is a diagram showing the configuration of the high-speed search table 3 in FIG. FIG. 4 is a diagram showing the configuration, FIG. 4 is a diagram showing node connection target arcs in the node matching processing method of FIG. 1, and FIG. 5 is a diagram showing the result of node matching processing of the arcs of FIG. 4. DESCRIPTION OF SYMBOLS 1... Node table, 2... Table conversion processing unit, 3... High speed search table, 4... Node matching processing unit, 11... X coordinate table, 12... Y coordinate table, 13... Serial number table, 31... High speed coordinate table, 32... High speed serial number table.

Claims (1)

[Claims] 1. A node matching processing method when connecting nodes of arcs, which comprises: an X-coordinate table storing the X-coordinate values of nodes to be connected; a node table consisting of a Y-coordinate table in which Y-coordinate values of the nodes are stored in correspondence with the values; a serial number table in which sequence numbers corresponding to the X-coordinate values and Y-coordinate values of each node are stored; A high-speed coordinate table in which the coordinate values stored in the X-coordinate table or Y-coordinate table in the table are sorted and stored in ascending order, and the sequence numbers stored in the serial number table in the node table are a table conversion processing unit that creates a high-speed search table from a high-speed sequential number table that is sorted and stored in accordance with the coordinate values stored in the table; and a coordinate value of a connection target node of the high-speed coordinate table in the high-speed search table. A coordinate value is not stored in the high-speed coordinate table that corresponds to a sequence number in the serial number table in the node table that has the same number as a sequence number in the high-speed serial number table that corresponds to a coordinate value that is within a tolerance range from Among the nodes whose coordinate values in the Y-coordinate table or a node matching processing unit that detects the X coordinate value and Y coordinate value of and changes the coordinate values of the connection target node on the X coordinate table and the X coordinate table to the X coordinate value and Y coordinate value, respectively. Matching processing method.