Dynamic dispatching and displaying method, device and equipment of massive data and storage medium

Abstract

The embodiment of the invention discloses a dynamic dispatching and displaying method, device and equipment of massive data and a computer readable storage medium. The method comprises the steps of calculating an initial hierarchy of a quad-tree structure within a global range according a vector data hierarchy range of vector data; according to the initial hierarchy range of the quad-tree structure and the preset tile size, determining the number of hierarchies of the quad-tree structure; initializing a tile node of the initial hierarchy; according to a preset rule, processing the tile node ofthe initial hierarchy, determining a target tile node satisfying preset conditions and requesting the vector data crossing the tile range of the target tile node to dispatch the data; according to each piece of requested vector data, building a corresponding drawing node and making all the drawing nodes hung on the target tile node. Massive vector data can be dynamically dispatched in a three-dimensional scene, the data amount in memory is effectively reduced, and the system performance is improved.

Description

technical field [0001] Embodiments of the present invention relate to the technical field of geographic information systems, and in particular, to a method, device, equipment, and computer-readable storage medium for dynamic scheduling and display of massive data. Background technique [0002] With the development of science and technology, three-dimensional scene technologies such as geographic information systems are more and more widely used in daily life, and the effective scheduling of vector data in three-dimensional scenes is particularly important for the development of three-dimensional scene technologies. [0003] At present, when scheduling the vector data in the 3D scene in the prior art, all the spatial data are loaded into the memory by parsing the vector data at one time, but because the memory size is limited, the scheduled vector The size of the data is limited, and when the data to be scheduled is massive, the scheduling method in the prior art cannot reali...

AI Technical Summary

Problems solved by technology

[0003] At present, when scheduling the vector data in the 3D scene in the prior art, all the spatial data are loaded into the memory by parsing the vector data at one time, but because the memory size is limited, the scheduled vector The size of the data is limited. When the data to be scheduled is massive data, the scheduling method in the prior art cannot realize the scheduling of massive data.

Images