Dynamic grid generation method, generation device, polymerization method and polymerization device

Abstract

The invention discloses a dynamic grid generation method. The dynamic grid generation method comprises the following steps: taking a sealed region formed by maximum and minimum longitude and latitude lines of a current display region as a reference region of the current display region; finding out a reference point closest to any point of the reference region as a closest reference point, wherein the closest reference point is found from a pre-stored reference point database or is instantly generated from the known reference points; and taking the closest reference point as a starting point for extending in the longitude and latitude directions to generate a minimum dynamic grid which is composed of a plurality of unit grids and completely covers the current display region. The invention further discloses a dynamic grid generation device, and a polymerization method and device based on the dynamic grid. With the adoption of the embodiment of the invention, the problems in a grid clustering algorithm that a lot of data need to be stored, the data processing speed is low and the polymerization errors are great can be effectively solved.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to a method and device for generating a dynamic grid, and an aggregation method and device based on the dynamic grid. Background technique [0002] Clustering is the process of grouping a collection of physical or abstract objects into classes of similar objects. Clustering algorithms can be divided into the following categories: partitioning methods, hierarchical methods, density-based methods, grid-based methods, and model-based methods. Among them, grid clustering algorithms have a very wide range of applications in geology and geography. application. [0003] The grid clustering algorithm adopts the grid data structure, divides the space into multiple units, and these units form a grid structure, and all clustering operations are performed on the grid. In the grid clustering algorithm, the range of each grid should be determined or defined first, and then the ag...

AI Technical Summary

Problems solved by technology

[0007] In the first method, the data needs to be stored in the reference point database first. Since the surface area of ​​the earth is about 5.1 square kilometers, assuming that the defined grid area is 0.1 square kilometers, the amount of data that needs to be stored in advance reaches 5.1 billion. If you want to define grids of other sizes, you need to calculate and store the range of each grid; and when the amount of data becomes larger and larger, more and more data will be stored, and the efficiency will become slower and slower

[0008] The second method, since each grid range is obtained by dividing the current display area by the number of grids, the grid range will change according to the current display area (the same display level display area will change), so the aggregated data There will be a large deviation

Images