JPH07262344A - Map system - Google Patents

Abstract

PURPOSE:To speedily and easily display a map by applying area numbers while dividing the entire map into meshed shapes, calculating the area number where each of map data exists, preserving those area numbers as a bit sequence, comparing the bit sequence of the displayed area with the bit sequence of preserved map data at the time of display and deciding a display object when those bit sequences are matched, concerning the map system for adding the bit sequences expressing the area numbers existent in the map data. CONSTITUTION:This system is provided with an area number preparing means 2 for respectively dividing the entire map into plural parts in X and Y directions and for preparing the bit sequences in the X and Y directions setting the area numbers existent for each of map data and the bit sequences in the X and Y directions turning the bit of the area number existent inside a rectangle, which includes the map data, to '1' for each of map data on the map, and these prepared bit sequences in the X and Y directions are added to the map data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a map system for adding a bit string representing an area code existing in map data.

[0002]

2. Description of the Related Art Conventionally, when it is attempted to display the data in the display area from the map data on the display, as shown in the flow chart of FIG. 7, the map data are extracted one by one and exist in the display area. Whether or not to do so is displayed, and when it is present, it is displayed, when it is not present, it is hidden, and all data is repeatedly displayed. The flowchart of FIG. 7 will be briefly described below.

FIG. 7 shows an explanatory flow chart of the prior art. In FIG. 7, S41 specifies the display area.
For this, the operator designates and specifies the area to be displayed on the map data.

In step S42, the map data is read in order. S
43 determines whether the map data read in S42 is within the display area. If YES, the image is displayed on the display in S45, and the process proceeds to S45. On the other hand, if NO, S4
Go to 5.

In step S45, it is determined whether all the map data has been read. In the case of YES, the processing of displaying all the map data when it exists in the display area and hiding it when it does not exist is ended, so the processing ends. On the other hand, N
In the case of O, the process returns to S42 and is repeated for the next map data.

[0006]

As described above, in the conventional map display, it is necessary to repeat the process of displaying the map when it exists in the display area and hiding it when it does not exist for all map data. However, there is a problem that it is difficult and time-consuming to determine which map data exists in the display area. Therefore, it is desired to divide the map into a mesh shape in advance and obtain an area (regional number) existing for each map data so that the map data to be displayed can be easily selected at the time of display.

The present invention solves these problems.
Divide the whole map into a mesh shape and assign a regional number,
The area number in which each map data exists is found and saved as a bit string, and the bit string of the display area is compared with the bit string of the saved map data at the time of display, and if they match, it is determined as the display target and the map can be displayed quickly and easily. The purpose is to

[0008]

FIG. 1 shows a principle book diagram of the present invention. In FIG. 1, a map system 1 manages map data 5 and 6, and is composed of a region number creating means 2, an input / output means 3 and a display means 4 here.

The area number creating means 2 creates an X-direction and Y-direction bit string 21 in which the bits of the area number existing in the rectangle included in each map data on the map are set to 1.

The bit string 21 is obtained by dividing the entire map into a plurality of parts in the X direction and the Y direction and setting existing area numbers. The input / output unit 3 inputs / outputs map data between the map data (old) 5 and the map data (new) 6.

The display device 7 displays various data.

[0012]

According to the present invention, as shown in FIG. 1, the area number creating means 2 sets, for each piece of map data on the map, the area number bit existing in the rectangle containing the map data to 1 in the X direction and A bit string 21 in the Y direction is created, and the created bit string 21 in the X and Y directions is added to the map data.

At this time, the area number creating means 2 sets, for each piece of map data on the map, the nodes of the map data and the line of the area number at which the line segment connecting the nodes intersects in the X direction. And the Y-direction bit string 21 are created, and the created X-direction and Y-direction bit string 21 is ORed to create the X-direction and Y-direction bit string 21.

Also, as the bit of the area number where the line segment connecting the nodes intersects, the bit of the area number in the X and Y directions between the area number of the node and the area number of another node is set to 1. The bit string 21 in the X direction and the Y direction is created.

Therefore, by dividing the entire map into a mesh shape and assigning area numbers, and determining the area number in which each map data exists and saving it as a bit string, the area number belonging to each map data is a bit string. Since the map data is stored, it is possible to determine which map data exists in the specific area at a very high speed by bit operation of the bit string. In particular, at the time of display, the bit string of the display area and the bit string of the stored map data are logically operated in bit correspondence, and when they match, it is possible to determine the display target and display the map quickly and easily.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the construction and operation of an embodiment of the present invention will be described in detail with reference to FIGS.

According to the order shown in the flow chart of FIG.
The operation of the configuration of FIG. 1 will be described in detail. In FIG. 2, S
1 reads the map data (line segment unit). This takes in the map data shown in (a) of FIG. 6 which will be described later as map data for each line segment on the map. In the map data of FIG. 6A, the number of nodes is four (node a1,
a2, a3, and a4), which are represented as map data A in FIG.

In S2, the area number intersecting between the head node (a1) and the next node (a2) is obtained and represented by a bit string. This is represented by a bit string 21 by obtaining an area number that intersects the line segment of the head node a1 of the map data A and the next node a2, as shown in FIG. 6B described later. As a result, it is obtained as the bit string 21 of the area number where the line segments connecting the nodes intersect.

In S3, it is determined whether the line segment is the end. This determines whether all the line segments between nodes have been completed. In the case of YES, it progresses to S4. In the case of NO, S2 is repeated between the next node and the node.

In S4, the bit string of the entire line segment is ORed to obtain the bit string. As a result, with respect to the map data in units of line segments, the bit string 21 in which the rectangular area number including the map data is 1 is obtained.

S5 is added to the map data (line segment unit). This is to add the bit string 21 obtained for each line segment in S4 to the corresponding map data. In S6, it is determined whether or not the entire map data has ended. If YES, then end. N
If it is O, the process returns to S1.

As described above, with respect to the map data extracted in line segment units on the map, the node and the area number intersecting with the line segment connecting the nodes are obtained in the X direction and the Y direction.
The bit strings in the X direction and the Y direction, which are the result of the OR operation of the bit strings 21, are added to the map data. As a result, it is possible to immediately determine the area number in which the map data exists, and particularly when the map data is displayed in the specific area, the bit string 21
Then, the bit string 21 of the display area to be displayed is logically operated to determine that there is a match, and it can be determined extremely quickly and easily whether or not the map data exists in the display area. The details will be sequentially described below.

FIG. 3 is an explanatory diagram of the area number / bit string of the present invention. FIG. 3A shows an example of area numbers. This area number shows an example in which the entire map is divided into eight in the X direction and eight in the Y direction for easy understanding. Region numbers 0 to 7 are assigned to the respective divided parts.

FIG. 3B shows a bit string (X direction). The bit string 21 corresponds to each bit divided into eight parts in the X direction of FIG. As described in the lower part, each bit is set to 1 if it exists in the X-direction area number, and 0 if it does not exist in the X-direction area number. As a result, 1 is set in the bit of the area number where the map data exists and 0 is set in the bit of the area number that does not exist.

FIG. 3C shows an example of a bit string. The bit string consists of the X direction and the Y direction. For example, in the case of map data A of FIG. (See (d) of FIG. 6). This means that the map data A is included in a rectangle composed of area numbers 0, 1, 2, 3, 4, 5, 6 in the X direction and area numbers 6, 7 in the Y direction (see FIG. 4). See map data A).

FIG. 4 is an explanatory diagram of the area number, map data and display area of the present invention. Here, the numbers in the X direction represent area numbers, and the numbers in the Y direction represent area numbers. A: represents the map data A, nodes a1, a2, a3, a
It consists of 4.

B: represents the map data B, and nodes b1 and b
2, b3, b4 and b5. C: represents the map data C, and the nodes c1, c2, c3, c
It consists of 4. D: represents the map data D, and the nodes d1, d2, d3, d
4, d5, d6 and d7. D1, D2, D3, and D4 represent intersections between the display area E and the map data D.

E: represents a display area E. FIG. 5 shows a flowchart for creating a bit string of the present invention.
This illustrates a procedure for creating a rectangular area number in which the map data A, B, C, and D on the map of FIG. 4 are contained as a bit string.

In FIG. 5, S11 reads the map data. This reads the map data A as shown in FIG. S12 is a map data node (a
The bit string of the map data is calculated from the mesh in which 1, a2, a3, a4) exist. This calculates the bit strings 21 in the X direction and the Y direction for the nodes a1, a2, a3, and a4 of the map data A of FIG. 4, respectively. For example, in the node a1, since the region number 0 in the X direction is 1 and the region number 7 in the Y direction is 1, as shown in (b-1) of FIG. 6, an X direction bit string Y direction bit string 0000 0001 Calculated as 1000 0000. Similarly, the bit strings 21 in the X and Y directions are calculated for the nodes a2, a3, and a4.

In step S13, the bit string of the map data is calculated from the mesh in which the line segment between the node of the map data and the previous node exists. As shown in (b-3) of FIG. 6, for example, a bit string in which the bit of the mesh where the line segment connecting the nodes a1 and a2 intersects is set to 1 is calculated. As a result, the bit string 21 in which the bit at which the line segment intersects is set to 1 is calculated.

In S14, a region where the line segment of the node of the map data and the line segment of the immediately preceding node intersect is determined and added to the bit string. As shown in (b-3) of FIG. 6, here, a bit string in which the bit of the mesh where the line segment connecting the node a1 and the node a2 intersects is set to 1 is calculated, and in this calculated bit string and S13. The calculated bit string of the node is ORed and added to the previous bit string to finally obtain the entire bit string shown in (d) of FIG. As a result, a rectangular bit string including the graphic data is calculated for each graphic data.

In step S15, it is determined whether all the nodes have been processed. In the case of YES, it progresses to S16. In the case of NO, the process returns to S12 and is repeated for the next node. S1
6 writes in the map data. Since a bit string of one map data (see (d) of FIG. 6) can be generated in S15, this is written in association with the map data. The written bit string 21 is used to determine whether to be a display target by calculating the bit string in the area determination at the time of display.

In step S17, it is determined whether all map data has been read. If YES, then end. In the case of NO, the process returns to S11 and is repeated for the next map data.
By the above, the map data on the map is extracted one by one, and the bit string of each node and the bit string of the line segment connecting the nodes are calculated for each of the extracted map data, and the bit string obtained by ORing all the bit strings is calculated. Is written in association with the map data. As a result, a bit string representing a rectangle including the map data is added to all the map data.

FIG. 6 is a diagram for explaining the creation of the bit string of the present invention. This is the bit string of nodes ((b-1), (b-2)) for the map data A on the map of FIG. 4, and the bit strings of line segments connecting nodes ((b-3), (b-
4)), the state of sequentially calculating the entire bit string ((d)) is shown.

FIG. 6A shows map data. This is for the map data A in FIG. 4, the total number of nodes is 4, the coordinates of the node a1 (a1x, a1y), the coordinates of the node a2 (a2x, a2y), the coordinates of the node a3. (A3x, a3y), coordinates of the node a4 (a4x, a4y) ,.

FIG. 6B shows a bit string. FIG. 6B-1 shows the bit string of the node a1. Node a
1 is the node a1 of the map data A in FIG. 4, and the region number 0 in the X direction is 1 and the region number 7 in the Y direction is 1. Therefore, as shown in the drawing, the bit string in the X direction, the bit string in the Y direction, 0000. 0001 1000 0000.

FIG. 6B-2 shows the bit string of the node a2. The node a2 is the node a2 of the map data A in FIG. 4, and the area number 2 in the X direction is 1 and the area number 6 in the Y direction is 1. Therefore, as shown in the drawing, the bit string in the X direction and the bit string in the Y direction. It becomes 0000 0100 0100 0000.

FIG. 6B-3 shows a bit string of line segment intersections a1-a2. This is node a1 and node a2
Since the area number that intersects the line segment that connects is 1 in the X direction (excluding the area numbers that are the same as node a1 and node a2),
As shown below, the bit string in the X direction is the bit string in the Y direction 0000 0010 0000 0000.

(B-4) of FIG. 6 shows (b-1) and (b-
2) shows a bit string obtained by ORing (b-3). As a result, a bit string in which the area number of a rectangle including the nodes a1 and a2 is set to 1 is obtained.

Similarly, FIG. 6C shows a2-a3, a
3-A4 bit string is obtained. FIG. 6D shows a1-
The bit strings of a2, a2-a3, and a3-a4 are ORed.
As a result, all the nodes a1, a2 of the map data A,
This means that the OR operation of the bit strings for a3 and a4 was performed, and the rectangular area number including all these nodes could be calculated as the bit string. The result is a bit string in the X direction and a bit string in the Y direction 0111 1111 1100 0000 shown as a1-a4.

In this embodiment, the entire map is divided into the X direction and the Y direction, and the area numbers are given respectively (in the embodiment, the area number is divided into 8 and the area numbers from 0 to 7 are given to the X direction and the Y direction). However, regarding the map data existing on the map, the rectangular area number that includes the map data is represented by a bit string. In addition to this, the area included in the map data is first obtained and then the relevant area is obtained. A bit string may be created by determining which area number the area corresponds to.

[0042]

As described above, according to the present invention,
Divide the whole map into a mesh shape and assign a regional number,
The bit string 21 is searched for the area number where each map data exists.
Since the map number is calculated and added to the map data, the region number belonging to each map data is saved as a bit string, and the bit operation of the bit string is performed to determine in which area on the map the map data exists. This makes it possible to make an extremely fast determination. In particular, at the time of display, the area number of the display area and the area number of the stored map data are logically operated in bit correspondence, and when they match, the area is determined as the display target and the map can be displayed quickly and easily.

[Brief description of drawings]

FIG. 1 is a principle block diagram of the present invention.

FIG. 2 is a flowchart explaining the operation of the present invention.

FIG. 3 is an explanatory diagram of area numbers / bit strings according to the present invention.

FIG. 4 is an explanatory diagram of area numbers, map data, and display areas according to the present invention.

FIG. 5 is a flowchart for creating a bit string of the present invention.

FIG. 6 is an explanatory diagram of creating a bit string of the present invention.

FIG. 7 is an explanatory flowchart of a conventional technique.

[Explanation of symbols]

 1: Map system 2: Area number creating means 3: Input / output means 4: Display means 5, 6: Map data 7: Display device

Claims (3)

[Claims] 1. An X-direction and Y-direction bit string (21) for dividing an entire map into a plurality of regions in the X and Y directions and assigning region numbers, and setting region numbers existing for each map data. Area number creating means (2) for creating a bit string (21) in the X and Y directions in which the bit of the area number existing in a rectangle containing the map data is set to 1 for each map data on the map. A map system comprising: the created X-direction and Y-direction bit strings (21) added to map data. 2. The area number creating means (2) sets, for each piece of map data on the map, each node constituting the map data and the bit of the area number at which the line segment connecting the nodes intersects to each other. Bit strings in the X and Y directions (2
1) are created respectively, and the created X direction and Y are created.
The map system according to claim 1, wherein a bit string (21) in the X and Y directions is created by ORing the bit strings (21) in each direction. 3. The bits of the area number in the X direction and the Y direction from the area number of the node to the area numbers of other nodes are used as the area number bits at which the line segments connecting the nodes intersect. 3. The map system according to claim 2, wherein a bit string (21) in the X direction and the Y direction is set to 1.