Rainfall Distribution Based on a Delaunay Triangulation Method
暂无分享,去创建一个
Many rainfall-run-off distributed models need rainfall data as input on a pixel by pixel basis, for each time interval. Due to the large amount of pixels that can make up a basin (proportional to the map scale), a fast and efficient method must be devised in order to obtain the rainfall field for each time interval (e.g. 20 minutes). Most models use interpolation methods such as the Inverse Distance Weighted. However, we propose the use of a Delaunay Triangulation using the incremental algorithm developed by Watson. The rainfall stations are used as the vertices of the triangles. They represent a three dimensional plane of the rainfall. Once the equation of the plane is known, a rainfall value for each pixel is calculated. We compare both methods and evaluate the sensitivity of the latter.
[1] D. Shepard. A two-dimensional interpolation function for irregularly-spaced data , 1968, ACM National Conference.
[2] S. OscarJ.Mesa,et al. Introducción al clima de Colombia , 1997 .
[3] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..
[4] David W. S. Wong,et al. An adaptive inverse-distance weighting spatial interpolation technique , 2008, Comput. Geosci..