2011 | OriginalPaper | Chapter
Rainfall Distribution Based on a Delaunay Triangulation Method
Authors : Nicolas Velasquez, Veronica Botero, Jaime Ignacio Velez
Published in: Transactions on Computational Science XIV
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 where the rainfall stations are used as the vertices of the triangles that 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 to changes in time and spatial scales separately.