论文部分内容阅读
作者在本文中提出一种数据网格化的快速算法局部搜索算法。该算法利用目前计算机编程环境提供的动态存储分配功能 ,首先将需网格化的所有数据划分到各个子块中 ,网格化时在一个或几个子块中搜索网格点的相邻点 ,而不是对所有数据进行搜索 ,提高了数据网格化的搜索效率 ,对于数据量较大的网格化问题可极大地提高效率。经实际应用证明 ,该方法稳定、可靠 ,是一种值得推广应用的快速算法。
In this paper, the authors propose a fast algorithm local search algorithm for data gridding. The algorithm uses the dynamic memory allocation function provided by the current computer programming environment. Firstly, all the data to be gridded are divided into sub-blocks, and the adjacent points of the grid points are searched in one or several sub- Instead of searching for all the data, the searching efficiency of data gridding is improved, and the gridding problem of large data volume can greatly improve the efficiency. The practical application proves that the method is stable and reliable and is a fast algorithm that is worth popularizing and applying.