【摘要】 作者在本文中提出一种数据网格化的快速算法局部搜索算法。该算法利用目前计算机编程环境提供的动态存储分配功能 ,首先将需网格化的所有数据划分到各个子块中 ,网格化时在一个或几个子块中搜索网格点的相邻点 ,而不是对所有数据进行搜索 ,提高了数据网格化的搜索效率 ,对于数据量较大的网格化问题可极大地提高效率。经实际应用证明 ,该方法稳定、可靠 ,是一种值得推广应用的快速算法。更多还原

【Abstract】 This paper deals with a fast Surface Data Gridding Arithmetic called LSGA(Local Search Gridding Arithmetic). We divide the whole grid region into many sub region and keep all data coming from every sub region respectively utilizing dynamic memory allocation. We can search grid point′s adjoining point in one or nine sub region instead of searching in whole grid region. This method is very efficient to a great number of original data points. Numerical calculating results show that this method is stable and effective.更多还原