JPH05197790A - Map graphic data managing system - Google Patents

Abstract

PURPOSE:To contract data volume and to simplify the management of graphic data by adopting a virtual mesh in order to store a graphic covering the boundary of meshes and storing all graphics only in one mesh. CONSTITUTION:A digitizer 101, an image scanner 102, a magnetic tap (MT device) 103, etc., are used as input devices. A computer (CPU) 20 is provided with a vectorizing processing part 201, a map graphic data storing address distributing part 202, a map graphic data retrieving processing part 203, and a display processing part 204. A map data base is stored in a secondary (external) stoage device 30. A display device 40 consisting of a display or the like is connected to the CPU 20. A storing address (virtual mesh) of a storing means is set up on the boundary of adjacent meshes and a graphic covering the boundary of the meshes is stored in the virtual mesh corresponding to the boundary, so that pointer information for recognizing the same graphic out of plural graphics is made unnecessary.

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, in a computer system in which graphic data on a map is divided and stored and managed by a rectangular area (hereinafter referred to as a mesh), the mesh boundary is straddled. The present invention relates to a storage management method of 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 data search processing when partial map search display and partial graphic data update and correction are performed. 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, but the handling of the graphic data straddling the mesh boundary becomes a problem.

In general, among the graphic data forming the map, the size of the mesh is set so that the minimum rectangle enclosing the graphic data has the maximum size. It is possible not to have graphic data over 3 meshes in each of the direction and the horizontal direction.

However, the existence of a graphic extending over 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> FIG. 12 is a diagram for explaining the method A. 1 is a figure of mesh A, 2 is mesh B
, 3 is a mesh C figure, 4 is a mesh D figure, 5 is a figure that straddles the mesh boundary between mesh A and mesh B, 6 is a figure that straddles the mesh boundary between mesh A and mesh C, 7 is mesh A, It is a figure that straddles B, C, and D.

The method A is a method of storing a figure extending over the boundary of the mesh in any one of the meshes.
As shown in FIG. 12B, when it is desired to display the mesh B and the graphic data of only the mesh B is displayed, the graphic of the graphic data 5 and 7 extending over the mesh boundary line originally located in the mesh B is not displayed. .. Also, when trying to display an image located on mesh B, meshes A, C,
D will be displayed, and graphic 1 of mesh A, graphic 3 of mesh C, and graphic 4 of mesh D must be processed.

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

Method B is a method of storing a figure that straddles the boundary of a mesh by dividing it into mesh lines. For example, as shown by the arrow in FIG. Add information that there is.
In this method B, as shown in (c) of FIG. 13, a simple graphic becomes complicated and a large amount of data is stored when the graphic is stored.

<Method C> FIG. 14 is a diagram for explaining the method C, and those having the same functions as those in FIG. 12 are designated by the same reference numerals.

In the method C, a figure straddling the boundary of the mesh is
As shown in FIG. 14 (b), this figure is a method of copying and storing it in all such meshes. As can be seen from FIG. 14 (b), this method C is the same as the one indicated by the arrow. Must have some cognitive information.

[0012]

However, in the method A, since a certain mesh does not store the original figure, processing for each mesh is not easy. For example, in the case of displaying for each mesh, a drawing near the boundary may not be displayed correctly, or it may take a long processing time to display all the graphic data in the adjacent mesh in order to display it correctly.

In the method B, a process for dividing a graphic must be performed, and as a result, a simple graphic is complicated and the amount of graphic data is often large.

Further, in the method B and the method C, since the figure which was originally one is divided and managed, it is necessary to recognize which figure of the adjacent mesh and which figure are the same. The pointer information must be provided, and processing for restoring the divided figures and processing for changing the pointer information are required in processing for changing or moving the figures.

The present invention has been made to solve the above-mentioned problems, and an object of the present invention is to provide a technique capable of handling a figure extending over the boundary of a mesh as one figure. ..

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

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

[0018]

In order to achieve the above object, the present invention divides a map into units of mesh (rectangular area), and divides and manages graphic data constituting the map in units of the mesh. In a computer system, first storage means for storing graphic data for each mesh, second storage means for storing graphic data for each mesh boundary line, and first storage means for storing graphic data for each intersection of each mesh boundary line. Three
When storing the storage means and the graphic data, the graphic data which is completely included in the mesh is stored by the first storage means and is completely stored in two meshes which extend across the mesh boundary line and share the mesh boundary line. Is stored in the second storage means, straddles two or more boundary lines among the four mesh boundary lines sharing the intersection of the mesh boundary lines, and is completely contained in the four meshes sharing the intersection. The graphic data included in is stored in the third storage, and at the intersections of all rectangular areas, mesh boundaries, and mesh boundaries of the mesh on the map specified when displaying or searching the graphic data. The most main feature is that it is equipped with a search and display means for searching all the graphic data from the corresponding graphic data storage means and displaying it.

[0019]

According to the above-mentioned means, the storage destination (hereinafter referred to as a virtual mesh) by the storage means is placed at the boundary between the adjacent meshes, and the figure straddling the boundary of the mesh is changed to the virtual mesh corresponding to the boundary. Since only the data is stored, there is no need for pointer information for recognizing which is the same figure, and the amount of data can be reduced.
When changing such as moving or deleting a figure, simplifying the management of figure data is unnecessary because the processing of changing pointer information, figure processing, dividing the figure, or restoring the divided figure is unnecessary. You can measure.

[0020]

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

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

As shown in FIG. 1, this embodiment comprises an input device 10 comprising a digitizer, an image scanner, a magnetic tape, etc., a computer 20, a secondary (external) storage device 30 comprising a magnetic disk, a display, etc. Display device 4
It has 0.

As shown in FIG. 2, examples of the input device 10 include a digitizer 101 and an image scanner 1.
02, magnetic tape (MT device) 103 and the like.

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

A map database is stored in the secondary (external) storage device 30. The details will be described with reference to FIGS. 3 and 4.

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

In FIG. 4, a feeling that it takes half each is a lie, and a feeling that both are covered is positive. Reference numeral 301 denotes a storage destination area for storing the graphic data for each mesh (rectangular area), which is represented by a storage area (M1) in which the lower left corner of the mesh is filled with 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 filled with black. Three
Reference numeral 03 denotes a storage destination area that is stored by the third storage unit that stores graphic data at each intersection of each mesh boundary line, and is a storage area (M in which the lower right corner of the mesh is filled with black).
3).

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

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

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

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

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

Then, in order to explain the method of storing the graphic data of 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) corresponds 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, the storage destination of the first storage means, and when one of Nx and Ny is even, the second
When both the storage destination of the storage means and Nx and Ny are odd numbers, the storage destination of the third storage means is set.

FIG. 7 is a flow chart showing the processing procedure of the graphic data storage method of this embodiment. The processing procedure of the method for storing graphic data of this embodiment will be described with reference to FIG. First, the smallest rectangle including a figure is obtained (step 701). The lower left coordinate of the obtained rectangle is P ₁ = (X ₁ ,
Y ₁ ) and the upper right coordinates are 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 formula.

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

Next, the mesh numbers Mx _{1 at} the positions of P ₁ and P ₂
And Mx ₂ are equal to each other (step 704),
If they are equal (YES), the mesh number Nx = 2 · Mx ₁ is set (step 705). If they are not equal (NO), the mesh number Nx = 2 · Mx ₁ +1 is set (step 706), and the process 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), and if not equal (NO), the mesh number Ny = 2 · My ₁ +1 is set (step 70).
9) and proceeds to step 710. In step 710, the graphic is stored in Nx, Ny of the storage destination area of the secondary (external) storage device 30.

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

The figure numbers P in FIG.
An example of the relationship between the coordinates of ₁ and P ₂ and the storage area is as follows.

(1) Graphic (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
If YES in step 707, Ny = 2 × 2
= 4. In this case, the graphic does not cross the boundary, and in the storage area of the secondary (external) storage device 30, (N
x, Ny) = (4, 4), which is stored in the first storage means.

(2) A figure (figure number) stored in the second storage means, P ₁ = (Mx ₁ , My ₁ ) = (1,2) P ₂ = (Mx ₂ , My ₂ ) = (1, 3) When YES at step 704, Nx = 2 × 1 = 2
When NO in step 707, Ny = 2 × 2 +
1 = 5. In this case, the figure crosses the boundary, and in the storage destination area of the secondary (external) storage device 30, (N
x, Ny) = (2,5), which is stored in 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 at step 707, Ny = 2 ×
1 = 2. In this case, the graphic crosses the boundary, and in the storage destination area of the secondary (external) storage device 30, (N
x, Ny) = (5, 2), which is stored in the second storage means.

(4) Graphic (graphic number) stored by the third storage means, P ₁ = (Mx ₁ , My ₁ ) = (3, 2) P ₂ = (Mx ₂ , My ₂ ) = (4 3) If NO in step 704, Nx = 2 × 3 + 1 =
7, and if NO at step 707, Ny = 2 × 1
+ 1 = 5. In this case, the figure crosses the boundary, and in the storage destination area of the secondary (external) storage device 30, (N
x, Ny) = (5, 7), which is stored in 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, figures 801 to 80 are formed on rectangular meshes M11, M12, M21 and M22.
There is 7. Whether each figure crosses 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, M11 and M12, and a virtual mesh M111 for storing the figure across the boundaries of M21 and M22.
2, M1121, M1222, M2122 / M1122
To introduce.

As a result, a graphic, such as the graphic 802, which straddles the boundary of the mesh is not divided and is stored only in the virtual mesh M1112.

Of the drawings thus stored, for example, when it is desired to display only the mesh M12, the mesh M
11 and the virtual mesh M11 at the boundary between the mesh M11
If the figures stored in 21, M1122, and M1112 are displayed, the mesh M11 can be accurately displayed without performing display processing for useless figures (FIG. 10).

The movement of the figure can also be performed simply by, for example, M1.
If a graphic 801 inside 1 is moved to M2122 and becomes a graphic 1101 that straddles the mesh boundary line,
It is only necessary to change the position information of No. 1 to create FIG. 1101 and delete FIG. 801, and there is no need to change the pointer information for recognizing the straddle (FIG. 11).

Although the present invention has been specifically described based on the above embodiments, the present invention is not limited to the above embodiments,
It goes without saying that various modifications can be made without departing from the spirit of the invention.

[0050]

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

[Brief description of drawings]

FIG. 1 is a diagram showing a schematic configuration of an implementation device 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 of the present embodiment,

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

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

FIG. 6 is a diagram showing a storage format of a secondary (external) storage device of the present embodiment,

FIG. 7 is a flowchart showing a processing procedure of a method of storing graphic data according to the present embodiment,

FIG. 8 is a diagram for explaining the operation of the map graphic data management system of the present embodiment,

FIG. 9 is a diagram for explaining the operation of the map graphic data management system of the present embodiment,

FIG. 10 is a diagram for explaining the operation of the map graphic data management system of the present embodiment,

FIG. 11 is a diagram for explaining the operation of the map graphic data management system of this embodiment;

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

FIG. 13 is a diagram for explaining method B of the conventional storage management method;

FIG. 14 is a diagram for explaining method C of the conventional storage management method.

[Explanation of symbols]

1 ... Mesh A figure, 2 ... Mesh B figure, 3 ... Mesh C figure, 4 ... Mesh D figure, 5 ... Figure spanning the boundary between mesh A and mesh B, 6 ... Boundary between mesh A and mesh C Figure spanning 7 ... Mesh A, B, C,
Figure spanning D, 8 ... Mesh line, 10 ... Input device, 20 ... Calculator, 30 ... Secondary (external) storage device, 40
Display unit 101 Digitizer 102 Image scanner 103 Magnetic tape 201 Vectorization processing unit 202 Map map data storage destination distribution processing unit 2
03 ... Map graphic data search processing unit, 204 ... Display processing unit, 301 ... Storage destination area by first storage means, 302 ...
Storage destination area by the second storage means, 303 ... Storage destination area by the third storage means, 801 to 807 ... Graphic, 1101 ...
Moved figures, M11-M22 ... Normal mesh, M
1112 to M2122 ... A virtual mesh representing the boundaries of the mesh.

Claims (1)

[Claims] 1. A computer system that divides a map into rectangular area units and divides and manages the graphic data forming the map into rectangular area units. First storage means for storing the graphic data in each rectangular area. Second storage means for storing graphic data for each rectangular area boundary line, and third storage means for storing graphic data for each intersection of each rectangular area boundary line,
When storing the graphic data, the graphic data which is completely included in the rectangular area is stored by the first storage means, and is completely stored in two rectangular areas which extend over the rectangular area boundary line and share the rectangular area boundary line. Data stored in the second storage means is stored in the second storage means, and the four rectangular areas that share the intersection are spread over two or more of the four rectangular area boundaries that share the intersection of the rectangular areas. The storage means for storing the graphic data completely included in the third storage by the third storage, and all the rectangular areas, the rectangular area boundary lines, and the rectangles that cover the rectangular area on the map designated when displaying or searching the graphic data. A map graphic data storage management system characterized by comprising search display means for retrieving all graphic data from a storage means for graphic data corresponding to intersections of area boundaries and displaying the data.