Effect of Spatial Decomposition on the Efficiency of k Nearest Neighbors Search in Spatial Interpolation
Spatial interpolations are commonly used in geometric modeling for life science applications. In large-scale spatial interpolations, it is always needed to find a local set of data points for each interpolated point using the k Nearest Neighbor (kNN) search procedure. To improve the computational efficiency of kNN search, spatial decomposition structures such as grids and trees are employed to fastly locate the nearest neighbors. Among those spatial decomposition structures, the uniform grid is the simplest one, and the size of the grid cell could strongly affect the efficiency of kNN search. In this paper, we evaluate the effect of the size of uniform grid cell on the efficiency of kNN search. Our objective is to find the relatively optimal size of grid cell by considering the distribution of scattered points (i.e., the data points and the interpolated points). We employ the Standard Deviation of points’ coordinates to measure the spatial distribution of scattered points. For the irregularly distributed scattered points, we perform several series of kNN search procedures in two dimensions. Benchmark results indicate that: in two dimensions, with the increase of the Standard Deviation of points’ coordinates, the relatively optimal size of the grid cell decreases and eventually converges. The relationships between the Standard Deviation of scattered points’ coordinates and the relatively optimal size of grid cell are also fitted. The fitted relationships could be applied to determine the relatively optimal grid cell in kNN search, and further, improve the computational efficiency of spatial interpolations.
KeywordsSpatial interpolation k nearest neighbors (kNN) search Uniform grid Spatial distribution Standard error
This work was supported by the Natural Science Foundation of China (Grant Numbers 11602235 and 41772326), the China Postdoctoral Science Foundation (2015M571081), the Fundamental Research Funds for the Central Universities (2652017086).
- 4.Cavoretto, R., Rossi, A.D., Dell’Accio, F., Tommaso, F.D.: Fast computation of triangular shepard interpolants. J. Comput. Appl. Math. (2018). https://doi.org/10.1016/j.cam.2018.03.012
- 6.Cuomo, S., Galletti, A., Giunta, G., Starace, A.: Surface reconstruction from scattered point via RBF interpolation on GPU. In: Ganzha, M., Maciaszek, L., Paprzycki, M (eds.) 2013 Federated Conference on Computer Science and Information Systems (Fedcsis), pp. 433–440 (2013)Google Scholar
- 12.Li, S., Harner, E.J., Adjeroh, D.A.: Random KNN. In: Zhou, Z.H., et al. (eds.) 2014 IEEE International Conference on Data Mining Workshop (ICDMW), pp. 629–636 (2014)Google Scholar
- 15.Mei, G.: Evaluating the power of GPU acceleration for IDW interpolation algorithm. Sci. World J. 2014, 8 (2014)Google Scholar
- 20.Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: V*-kNN: an efficient algorithm for moving k nearest neighbor queries. In: ICDE: 2009 IEEE International Conference on Data Engineering, pp. 1519–1522 (2009)Google Scholar
- 21.Pan, J., Manocha, D.: Bi-level locality sensitive hashing for k-nearest neighbor computation. In: 2012 IEEE 28th IEEE International Conference on Data Engineering, pp. 378–389 (2012)Google Scholar
- 26.Volkau, I., Aziz, A., Nowinski, W.: Indirect interpolation of subcortical structures in the Talairach-Tournoux atlas, vol. 5367, pp. 533–537 (2004)Google Scholar