A method to improve the efficiency of rendering scenes in osgb data processing
A data processing and scene technology, applied in the field of improving the efficiency of rendering scenes, can solve the problem of high memory occupancy in large-scale scenes, and achieve the effect of preserving visual effects, reducing I/O burden, and reducing memory occupancy.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] (1) The initial unprocessed 671 osgb tile data, the top level is 16, and the bottom level is greater than 20;
[0024] (2) Recursively process the hierarchical depth of each top-level tile, break the existing hierarchical scheduling relationship, and realize cross-level orientation. For Geode type OSGB data, the original scheduling relationship is retained according to the principle of retaining the most detailed layer data;
[0025] (3) The odd-numbered levels are removed after simplification, and if the odd-numbered levels contain the grid data of the finest layer, they are retained. Obtain the bounding box data information of the simplified top-level node of the tile;
[0026] (4) Concentrate the bounding box information of all nodes into the newly created top-level node, and calculate the merged large bounding box information;
[0027] (5) Divide the bounding box of the created top-level node into a grid by the quartering method, classify the data nodes into the co...
Embodiment 2
[0030] Such as figure 1 As shown, node 2 contains sub-refined data, which lengthens the scheduling span. The node is simplified, and the link between node 1 and node 3 is re-established. If the levels of nodes 5 and 6 are simplified, because the 5 belongs to the fine layer data and should be retained in principle. Node 6 is sub-fine layer data, then the link relationship from node 4 to node 7 and node 8 is established.
[0031] Such as figure 2 As shown, the bounding box of all top-level nodes is obtained, and its center point c1 is obtained; the analysis shows that point n1 is the closest to c1, and the segmentation point s1 is obtained. Similarly, the split point s2 is obtained, until the number of data nodes in the child nodes is not greater than 4, the expected pyramid level can be constructed.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com