Non-redundant massive terrain data organizing and reading method

Abstract

The invention relates to a non-redundant massive terrain data organizing and reading method, which is characterized by comprising the following steps of: firstly, performing uniform block division on original terrain data; secondly, constructing a file RowFile and a file ColFile to store vertexes of shared sides between terrain blocks; and finally, constructing a terrain sub-block file to store the inner vertexes of the blocks. A redundant area of the terrain sub-block is singly stored, and different terrain sub-blocks share the redundant area. Meanwhile, the method eliminates data redundancy, well solves the problem of too much waste of storage space, and is a method suitable for organizing and storing massive terrain data.

Description

technical field

[0001] The invention relates to a data organization and reading method, which belongs to the field of information data storage, and in particular to a non-redundant organization method and reading method for large-scale terrain data. Background technique

[0002] With the introduction of the concept of "Digital Earth" and the development of aerial photography technology, the scale of raw terrain data available in the field of terrain visualization has gradually increased, and the scale of terrain data to be processed has reached TB level. It is impossible to load all such huge data into memory, so it must be stored in external memory, and then load part of the data into memory to participate in drawing when needed. This is the commonly used out-of-core technology.

[0003] The most important thing in the Out-of-core technology is to divide and store the original terrain data reasonably on the external memory. At present, the mainstream large-scale terrain ...

Examples

Embodiment Construction

[0042] The present invention will be further described below in conjunction with the accompanying drawings.

[0043] figure 1 is a structural schematic diagram of data storage in the prior art, where the edges of adjacent terrain sub-blocks represent redundant vertices.

[0044] Such as figure 2 As shown, it is a schematic diagram of terrain blocks with the original full resolution of 17*17. In this method, the terrain is first uniformly divided into blocks, and the original terrain resolution is M*N (M = N = 2 4 +1), the block size is K*K (K = 2 2 +1), 1<K < min(m,n); the number of blocks is P*Q (P = (M-1) / (K-1), Q = (N-1) / (K-1) ).

[0045] Each terrain sub-block is stored in a file separately. Since every two terrain sub-blocks contain the same vertices on the common side, in order to avoid redundant storage, the vertices on the common side are not stored in the terrain sub-block file, and the construction A dedicated file is used to store these public vertices. ...

technical field

[0001] The invention relates to a data organization and reading method, which belongs to the field of information data storage, and in particular to a non-redundant organization method and reading method for large-scale terrain data. Background technique

[0002] With the introduction of the concept of "Digital Earth" and the development of aerial photography technology, the scale of raw terrain data available in the field of terrain visualization has gradually increased, and the scale of terrain data to be processed has reached TB level. It is impossible to load all such huge data into memory, so it must be stored in external memory, and then load part of the data into memory to participate in drawing when needed. This is the commonly used out-of-core technology.

[0003] The most important thing in the Out-of-core technology is to divide and store the original terrain data reasonably on the external memory. At present, the mainstream large-scale terrain ...

Examples

Embodiment Construction

[0042] The present invention will be further described below in conjunction with the accompanying drawings.

[0043] figure 1 is a structural schematic diagram of data storage in the prior art, where the edges of adjacent terrain sub-blocks represent redundant vertices.

[0044] Such as figure 2 As shown, it is a schematic diagram of terrain blocks with the original full resolution of 17*17. In this method, the terrain is first uniformly divided into blocks, and the original terrain resolution is M*N (M = N = 2 4 +1), the block size is K*K (K = 2 2 +1), 1<K < min(m,n); the number of blocks is P*Q (P = (M-1) / (K-1), Q = (N-1) / (K-1) ).

[0045] Each terrain sub-block is stored in a file separately. Since every two terrain sub-blocks contain the same vertices on the common side, in order to avoid redundant storage, the vertices on the common side are not stored in the terrain sub-block file, and the construction A dedicated file is used to store these public vertices. ...

Images