<![CDATA[Irregular grid interpolation is one of the numerical functions that often used to approximate value on an arbitrary location in the area closed by non-regular grid pivot points. In this paper, we propose method for achieving efficient computation time of radial basis function-based non-regular grid interpolation on a cylindrical coordinate. Our method consist of two stages. The first stage is the computation of weights from solving linear RBF systems constructed by known pivot points. We divide the volume into many subvolumes. At second stages, interpolation on an arbitrary point could be done using weights calculated on the first stage. At first, we find the nearest point with the query point by structuring pivot points in a K-D tree structure. After that, using the closest pivot point, we could compute the interpolated value with RBF functions. We present the performance of our method based on computation time on two stages and its precision by calculating the mean square error between the interpolated values and analytic functions. Based on the performance evaluation, our method is acceptable.]]>
Copyrights © 2020
