Fast 3D kriging interpolation using Delaunay tetrahedron with CUDA-enabled GPU
Xingmiao Yao, Qian Wang, Zhining Liu, Guangmin Hu · 2015
Summary Kriging interpolation algorithm is a kind of optimal linear unbiased interpolation method and applied to many fields, especially in geological field. As a kind of regional algorithm, how to choose the neighbor points is an important part of kriging algorithm. Moreover, in recent years, with the wide use of kriging interpolation technology, higher efficiency of kriging interpolation is required and traditional kriging interpolation algorithm has not been able to meet the current requirement for efficiency. For kriging is an algorithm defined in the limited space domain, it has to select the calculation area, which is completed by selecting neighbor known points as input for interpolating unknown points. But the existing kriging interpolation method could not consider neighbor points. Instead, it uses all the known points as the input. And if all the known points are used as the input, the scheme will be infeasible. Considering these problems, this paper puts forward a fast kriging interpolation algorithm based on Delaunay tetrahedron with CUDA-enabled GPU, which establishes a spatial index for 3D Delaunay tetrahedron to quickly search neighbor points. Meanwhile, based on CUDA platform, an effective parallel interpolation strategy is proposed by using powerful computing capability of GPU to improve the efficiency of interpolation.