一种基于节点的相邻网格查找方法及系统
By constructing a hash table in the grid data and performing incremental updates, the problem of low efficiency in adjacency lookup in large-scale dynamic grid data is solved, realizing efficient and real-time grid adjacency lookup, which is suitable for large-scale grid data processing in computer-aided engineering.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SHANGHAI AVIATION IND GRP CO LTD
- Filing Date
- 2025-10-29
- Publication Date
- 2026-07-17
AI Technical Summary
Existing technologies suffer from low efficiency in querying grid adjacency relationships when processing large-scale dynamic grid data. In particular, the entire data structure needs to be reconstructed during local segmentation and merging operations, resulting in high computational load and slow query response speed, making it difficult to meet real-time requirements.
A hash table is used to construct the mapping relationship between nodes and grids, and only incremental updates are performed when the grid changes dynamically. The hash value is calculated by the MurmurHash algorithm, and a linked list is used to resolve collisions. The hash table capacity is dynamically expanded, and only the affected node and grid data are updated to avoid global reconstruction.
It improves the efficiency of grid adjacency relationship queries, reduces computational overhead, supports real-time updates of dynamic grid data, is suitable for efficient processing of millions of grid data, and meets real-time query requirements.
Smart Images
Figure CN121455950B_ABST