
Fast k-Nearest-Neighbors Calculation for Interpolation of Radar Reflectivity Field*
Author(s) -
Feng Gao
Publication year - 2009
Publication title -
journal of atmospheric and oceanic technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.774
H-Index - 124
eISSN - 1520-0426
pISSN - 0739-0572
DOI - 10.1175/2009jtecha1234.1
Subject(s) - interpolation (computer graphics) , grid , radar , computer science , volume (thermodynamics) , k nearest neighbors algorithm , point (geometry) , field (mathematics) , algorithm , sampling (signal processing) , radar imaging , reflectivity , remote sensing , computer vision , artificial intelligence , geology , image (mathematics) , mathematics , geodesy , optics , geometry , physics , telecommunications , filter (signal processing) , quantum mechanics , pure mathematics
To efficiently implement the interpolation methods (e.g., Shepard’s method and its variants) for the radar reflectivity field, a fast method that calculates the k-nearest-neighbor nodes (sampling points in radar volume scan) of the interpolated point (grid point) is described and proved. Several geometric propositions of radar volume scan on which the method is based are suggested and proved. Finally, the computational cost of the method is analyzed. The method is fast enough for real-time applications.