JP3110837B2 - Map figure data management method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a map graphic data storage management system, and more particularly, to a computer system which divides and manages graphic data on a map by using a rectangular area (hereinafter, referred to as a mesh) and straddles a boundary of the mesh. The present invention relates to a storage management system for graphic data.

[0002]

2. Description of the Related Art When managing map data having a large amount of graphic data by a computer, a map is constructed for the purpose of speeding up a partial search display of the map and a high-speed data search process when updating and correcting a part of the graphic data. Graphic data is divided and stored for each mesh. At this time, the graphic data completely included in the mesh can be easily handled by collectively storing and managing the data for each mesh. However, the handling of the graphic data over the mesh boundary line becomes a problem.

[0003] In general, the size of the mesh is set to be sufficiently large so as to completely include a rectangle having the largest size of the minimum rectangle surrounding the graphic data, among the graphic data constituting the map, so that the vertical length of the map is reduced. It is possible to make sure that there is no graphic data over three meshes in each of the direction and the lateral direction.

However, the existence of a figure straddling two meshes adjacent in the vertical direction, the horizontal direction or both directions is not hindered.

On the other hand, conventionally, the following storage management system has been adopted.

<Method A> FIGS. 12A and 12B are diagrams for explaining Method A, where 1 is a figure of a mesh A and 2 is a mesh B
, 3 is a mesh C figure, 4 is a mesh D figure, 5 is a figure straddling the mesh boundary between the meshes A and B, 6 is a figure straddling the mesh boundary between the mesh A and the mesh C, 7 is a mesh A, It is a figure straddling B, C, and D.

Method A is a method of storing a figure straddling the boundary of a mesh in any one of the meshes.
As shown in FIG. 12B, when the user wants to display the mesh B and displays only the graphic data of the mesh B, the graphics of the graphic data 5 and 7 that cross the mesh boundary line originally located on the mesh B are not displayed. . When an image located on the mesh B is to be displayed, meshes A, C,
D is displayed, and FIG. 1 of mesh A, FIG. 3 of mesh C, and FIG. 4 of mesh D must be processed.

<Method B> FIG. 13 is a diagram for explaining the method B. Elements having the same functions as those in FIG. 12 are denoted by the same reference numerals.

Method B is a method in which a graphic straddling the boundary of a mesh is divided and stored in a mesh line. For example, one figure is divided as indicated by an arrow shown in FIG. Add information that there is.
In this method B, as shown in FIG. 13C, a simple figure becomes complicated, and the data when storing the figure increases.

<System C> FIG. 14 is a diagram for explaining the system C. Components having the same functions as those in FIG. 12 are denoted by the same reference numerals.

In the method C, a figure straddling the boundary of the mesh is
As shown in FIG. 14 (b), the figure is copied and stored in all such meshes. As can be seen from FIG. 14 (b), in this method C, the same thing indicated by an arrow is used. You must have some recognition information.

[0012]

However, in the above-mentioned method A, since a figure which should be originally stored in a certain mesh is not stored, processing for each mesh is not easy. For example, when displaying for each mesh, a figure near the boundary is not displayed correctly, or it takes a long processing time to display all the graphic data in the adjacent mesh in order to display correctly.

In the method B, a process for dividing a figure must be performed, and as a result, a simple figure becomes complicated and the amount of figure data often increases.

Further, in the method B or the method C, a figure which was originally one is divided and managed, so that it is necessary to recognize which figure in the adjacent mesh is the same as which figure. It is necessary to have pointer information, and it is necessary to perform a process of restoring a divided graphic and a process of changing pointer information in a change process such as moving or deleting a graphic.

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and an object of the present invention is to provide a technique capable of treating a figure straddling a mesh boundary as one. .

Another object of the present invention is to provide a technique capable of realizing a map graphic data storage management system that facilitates processing for each mesh.

The above and other objects and novel features of the present invention will become apparent from the description of the present specification and the accompanying drawings.

[0018]

In order to achieve the above object, the present invention divides a map into mesh units (rectangular areas) and manages the graphic data constituting the map in units of mesh units. In the computer system, a first storage means for storing graphic data for each mesh, a second storage means for storing graphic data for each mesh boundary line, and a second storage means for storing graphic data for each intersection of each mesh boundary line. 3
When storing the graphic data, the graphic data completely contained in the mesh is stored by the first storage means, and the graphic data is completely stored in the two meshes which straddle the mesh boundary line and share the mesh boundary line. Is stored by the second storage means, and straddles two or more of the four mesh boundaries sharing the intersection of the mesh boundaries, and completely stores the four meshes sharing the intersection. Is stored in the third storage, and all rectangular areas, mesh boundaries, and intersections of mesh boundaries on the mesh specified on the map when displaying or searching for the graphic data are stored in the storage means. The most important feature is that search and display means for retrieving all the graphic data from the corresponding graphic data storage means and displaying the same is provided.

[0019]

According to the above-mentioned means, a storage destination (hereinafter, referred to as a virtual mesh) by the storage means is placed at a boundary between adjacent meshes, and a figure straddling the boundary of the mesh is converted to a virtual mesh corresponding to the boundary. Since only data is stored, pointer information for recognizing which is the same graphic is unnecessary, and the data amount can be reduced.
When making changes such as moving or deleting a figure, there is no need to change the pointer information, process the figure, divide the figure, or restore the divided figure. Can be measured.

[0020]

Embodiments of the present invention will be described below in detail with reference to the drawings.

FIG. 1 is a diagram showing a schematic configuration of one embodiment of an apparatus for implementing the map graphic data management system of the present invention.
FIG. 2 is a block diagram illustrating a functional configuration of a system of the present embodiment.

As shown in FIG. 1, the present embodiment comprises an input device 10, such as a digitizer, an image scanner, and a magnetic tape, a computer 20, a secondary (external) storage device 30, such as a magnetic disk, and a display. Display device 4
0 is provided.

As shown in FIG. 2, as the input device 10, for example, a digitizer 101, an image scanner 1
02, a magnetic tape (MT device) 103 or the like is used.

The computer (CPU) 20 includes a vectorization processing unit 201, a map graphic data storage destination distribution processing unit 2
02, map graphic data search processing unit 203, display processing unit 2
04.

The secondary (external) storage device 30 stores a map database. This will be described in detail with reference to FIGS.

FIG. 3 is a diagram showing an input map screen and a display map screen. FIG. 4 is a diagram showing a map database configuration stored in the secondary (external) storage device 30. 3 and 4, components having the same functions as those in FIG. 12 are denoted by the same reference numerals. L ₁ is a horizontal mesh length, L ₂ is the length of the vertical mesh, 8 is a mesh line.

In FIG. 4, a feeling that it takes half each time is a lie, and a thing that covers both of them is positive. Reference numeral 301 denotes a storage destination area which is stored by the first storage means for storing graphic data for each mesh (rectangular area), and is represented by a storage area (M1) in which the lower left corner of the mesh is painted black. Reference numeral 302 denotes a storage destination area that is stored by the second storage unit that stores graphic data for each mesh (rectangular area) boundary line, and is represented by a storage area (M2) in which the upper right corner of the mesh is painted black. 3
Numeral 03 denotes a storage area which is stored by the third storage means for storing graphic data for each intersection of each mesh boundary line, and is a storage area (M
3).

That is, in FIG. 4, the figure 1 of the mesh A, the figure 2 of the mesh B, the figure 3 of the mesh C and the figure 4 of the mesh D are figures completely included in the mesh, and are stored in the first storage means. Storage destination area (M1) 30
1 is stored.

The graphic 5 straddling the mesh boundary between the meshes A and B and the graphic 6 straddling the mesh boundary between the meshes A and C are included in two meshes that straddle the mesh boundary 8 and share the mesh boundary. A storage area (M2) 30 by the second storage means.
2 is stored.

The graphic 7 straddling the meshes A, B, C and D is a graphic included in the four meshes sharing the intersection, and is stored in the storage destination area (M3) 3 by the third storage means.
03 is stored.

Next, a method of storing graphic data according to the present embodiment will be described.

FIG. 5 is a diagram for explaining a method of storing graphic data according to the present embodiment. It is assumed that each graphic does not cross over two meshes in each of the vertical and horizontal directions. Further, one size is defined as horizontal L ₁ and vertical L ₂ .

In order to explain the method of storing graphic data according to the present embodiment, the storage format of the secondary (external) storage device 30 is assumed as shown in FIG. In FIG. 6, Mx,
My is a real mesh number on the display, and Nx and Ny are mesh numbers including a virtual mesh on the secondary (external) storage device 30, for example, (2) on the secondary (external) storage device 30. , 2) correspond to (1, 1) on the display. That is, in this embodiment, when the mesh numbers Nx and Ny on the secondary (external) storage device 30 are both even numbers, the storage destination by the first storage means, and when one of Nx and Ny is even, the second storage means is used.
When both the storage destination by the storage means and Nx and Ny are odd numbers, the storage destination by the third storage means is obtained.

FIG. 7 is a flowchart showing the processing procedure of the graphic data storage method according to this embodiment. The processing procedure of the graphic data storage method according to the present embodiment will be described with reference to FIG. First, a minimum rectangle including a figure is obtained (step 701). The lower left coordinate of the obtained rectangle is defined as P ₁ = (X ₁ ,
Y ₁ ), and the upper right coordinate is set to P ₂ = (X ₂ , Y ₂ ) (step 702). Next, the mesh numbers at the positions of P ₁ and P ₂ are obtained (step 703). The mesh numbers at the positions of P ₁ and P ₂ are obtained from the following equations.

Mx ₁ = INT (X ₁ / L ₁ ) +1 My ₁ = INT (Y ₁ / L ₂ ) +1 Mx ₂ = INT (X ₂ / L ₁ ) +1 My ₁ = INT (Y ₂ / L ₂ ) +1 Here, INT (A) represents the integer part of A.

Next, the mesh numbers Mx _{1 at} the positions of P ₁ and P ₂
And Mx ₂ and it is determined whether or not equal (step 704),
Equal (YES) mesh number Nx = 2 · Mx ₁ and then (step 705), not equal (NO) mesh number Nx = 2 · As Mx ₁ +1 (step 706), proceeds to step 707. At step 707, it is determined whether P _1, the position of P ₂ mesh number My ₁ and My ₂ are equal, equal, (YES) mesh number Ny = 2 · My ₁
(Step 708), if not equal (NO), the mesh number Ny = 2 · My ₁ +1 (Step 70)
9) Go to step 710. In step 710, the figure is stored in Nx, Ny of the storage area of the secondary (external) storage device 30.

That is, if the judgments in the steps 704 and 709 are both YES, the data is stored in the first storage means, and if one of the judgments in the steps 704 and 709 is YES, the data is stored in the second storage means. If the determinations in steps 704 and 709 are both NO, the data is stored by the third storage means.

The graphic numbers P, P shown in FIG.
_1, an example of the relationship between the coordinates and the storage destination area of P _2, as follows.

(1) A figure (graphic number) stored by the first storage means, P ₁ = (Mx ₁ , My ₁ ) = (2,2) P ₂ = (Mx ₂ , My ₂ ) = (2, ₂ ) 2) If YES in step 704, Nx = 2 × 2 = 4
And when YES in step 707, Ny = 2 × 2
= 4. In this case, the graphic does not cross the boundary, and (N) is stored in the storage destination area of the secondary (external) storage device 30.
(x, Ny) = (4, 4) and stored by the first storage means.

(2) A figure (graphic number) stored by the second storage means, P ₁ = (Mx ₁ , My ₁ ) = (1, 2) P ₂ = (Mx ₂ , My ₂ ) = (1, 3) If YES in step 704, Nx = 2 × 1 = 2
And when NO in step 707, Ny = 2 × 2 +
1 = 5. In this case, the graphic straddles the boundary, and in the storage destination area of the secondary (external) storage device 30, (N
(x, Ny) = (2, 5) and stored by the second storage means.

(3) Graphic (graphic number) stored by the second storage means, P ₁ = (Mx ₁ , My ₁ ) = (2,1) P ₂ = (Mx ₂ , My ₂ ) = (3, 1) If NO in step 704, Nx = 2 × 1 + 1 =
5, and if YES in step 707, Ny = 2 ×
1 = 2. In this case, the graphic straddles the boundary, and in the storage destination area of the secondary (external) storage device 30, (N
(x, Ny) = (5, 2) and stored by the second storage means.

(4) Figures (graphic numbers) stored by the third storage means, P ₁ = (Mx ₁ , My ₁ ) = (3,2) P ₂ = (Mx ₂ , My ₂ ) = (4,4) 3) If NO in step 704, Nx = 2 × 3 + 1 =
7 and when NO in step 707, Ny = 2 × 1
+ 1 = 5. In this case, the graphic straddles the boundary, and in the storage destination area of the secondary (external) storage device 30, (N
(x, Ny) = (5, 7) and is stored by the third storage means.

Next, the map graphic data management system of this embodiment will be described.

FIG. 8, FIG. 9, FIG. 10 and FIG. 11 are diagrams for explaining the map graphic data management system of this embodiment.

As shown in FIGS. 8 to 11, the rectangular meshes M11, M12, M21 and M22 have figures 801 to 80, respectively.
There are seven. For each figure, whether or not it straddles the boundary of the mesh is considered by the smallest rectangle including the figure. At this time, M1
1 and M12, M11 and M21, M12 and M22, M21
And M22, and M11 and M12, and a virtual mesh M111 for storing a graphic straddling the boundary between M21 and M22.
2, M1121, M1222, M2122, M1122
Is introduced.

As a result, the graphic straddling the boundary of the mesh, for example, the graphic 802 is stored in only the virtual mesh M1112 without being divided.

Of the drawings stored in this way, for example, when only the mesh M12 is to be displayed, the mesh M
11 and a virtual mesh M11 at the boundary of the mesh M11
If the graphics stored in 21, M1122, and M1112 are displayed, an accurate mesh M11 can be displayed without performing unnecessary display processing on the graphics (FIG. 10).

Also, the movement of the figure is performed, for example, by simply using M1
1 is moved to M2122 to be a graphic 1101 straddling a mesh boundary line,
1101 is created by changing the position information of FIG. 110, and only the process of deleting FIG. 801 is required, and the process of changing the pointer information for recognizing the straddle is unnecessary (FIG. 11).

Although the present invention has been described in detail with reference to the embodiments, the present invention is not limited to the above embodiments.
It goes without saying that various changes can be made without departing from the gist of the invention.

[0050]

As described above, according to the present invention, a virtual mesh is introduced in order to store a figure at the boundary of a mesh, and all figures are stored in only one mesh. Thus, since there is no graphic pointer information, the data amount can be reduced, and the management of graphic data can be simplified.

[Brief description of the drawings]

FIG. 1 is a diagram showing a schematic configuration of an embodiment of an embodiment for implementing a map graphic data management system of the present invention;

FIG. 2 is a block diagram showing a functional configuration of a system of the present embodiment;

FIG. 3 is a diagram showing an input map screen and a display map screen according to the embodiment;

FIG. 4 is a diagram showing a configuration of a map database stored in a secondary (external) storage device according to the embodiment;

FIG. 5 is a diagram for explaining a method of storing graphic data according to the embodiment;

FIG. 6 is a diagram illustrating a storage format of a secondary (external) storage device according to the embodiment;

FIG. 7 is a flowchart illustrating a processing procedure of a graphic data storage method according to the present exemplary embodiment;

FIG. 8 is a diagram for explaining the operation of the map graphic data management method according to the embodiment;

FIG. 9 is a diagram for explaining the operation of the map graphic data management method according to the present embodiment;

FIG. 10 is a diagram for explaining the operation of the map graphic data management method according to the embodiment;

FIG. 11 is a diagram for explaining the operation of the map graphic data management method according to the present embodiment;

FIG. 12 is a diagram for explaining a conventional storage management method A;

FIG. 13 is a diagram illustrating a conventional storage management method B.

FIG. 14 is a diagram illustrating a conventional storage management method C.

[Explanation of symbols]

1 ... Figure of mesh A, 2 ... Figure of mesh B, 3 ... Figure of mesh C, 4 ... Figure of mesh D, 5 ... Figure spanning the boundary between mesh A and mesh B, 6 ... Boundary of mesh A and mesh C , Meshes A, B, C,
A figure straddling D, 8 mesh lines, 10 input devices, 20 computer, 30 secondary (external) storage device, 40
.., Display device, 101, digitizer, 102, image scanner, 103, magnetic tape, 201, vectorization processing unit, 202, map graphic data storage destination distribution processing unit, 2
03: map graphic data search processing unit, 204: display processing unit, 301: storage area by the first storage unit, 302:
Storage destination area by the second storage means, 303... Storage destination area by the third storage means, 801 to 807... Figures, 1101.
Moved figure, M11-M22 ... normal mesh, M
1112 to M2122 ... A virtual mesh representing the boundary of the mesh.

──────────────────────────────────────────────────続 き Continued on the front page (58) Fields surveyed (Int. Cl. ⁷ , DB name) G06T 11/60 G06F 17/30 G09B 29/00

Claims (1)

(57) [Claims] 1. A computer system which divides a map into units of rectangular regions and manages the graphic data constituting the map by dividing and storing the data in units of rectangular regions. Second storage means for storing graphic data for each rectangular area boundary line, third storage means for storing graphic data for each intersection of each rectangular area boundary line,
When storing the graphic data, the graphic data completely contained in the rectangular area is stored by the first storage means, and the graphic data is completely stored in two rectangular areas which straddle the rectangular area boundary line and share the rectangular area boundary line. Are stored by the second storage means and straddle two or more of the four rectangular area boundaries that share the intersection of the rectangular area boundaries, and four rectangular areas that share the intersection Storage means for storing the graphic data completely contained in the third storage, and all the rectangular areas, rectangular area boundary lines, and rectangles related to the rectangular area on the map specified when displaying or searching for the graphic data A map graphic data storage management method comprising: a search and display means for retrieving all graphic data from a graphic data storage means corresponding to an intersection of an area boundary line and displaying the graphic data.