This paper describes the logic of a dynamic algorithm for a general 2D Delaunay triangulation of arbitrarily prescribed interior and boundary nodes. The complexity of the geometry is completely arbitrary. The scheme is free of specific restrictions on the input of the geometrical data. The scheme ge
A simple algorithm for generating streamflow networks for grid-based, macroscale hydrological models
β Scribed by Greg O'Donnell; Bart Nijssen; Dennis P. Lettenmaier
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 602 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0885-6087
No coin nor oath required. For personal study only.
β¦ Synopsis
A simple algorithm for generating streamΒ―ow networks for macroscale hydrological models (MHMs) from digital elevation models (DEMs) is presented. Typically these hydrological models are grid based, with the simulated runo produced within each cell routed through a stream network which connects the centers of cells in the direction of the major streams. Construction of such stream networks is a time consuming task, which has generally been done by hand with the aid of maps. Results indicate that the algorithm works satisfactorily in areas of both high and low relief, and for a wide range of model cell resolutions, although some manual adjustments may be necessary.
π SIMILAR VOLUMES
## Wang and Ding (2007) present a daily streamflow simulation model based on the Gaussian kernel function. The model is found powerful in preserving statistical characteristics of the daily streamflow sequences. The purpose of this comment is to improve the presentation of the proposed model. To m
His third suggestion is that a sequence of generated daily streamflow to show the time-irreversible structure of the daily streamflow hydrograph should be listed. This is a good suggestion. Owing to a constraint on the number of pages, generated daily streamflow hydrographs were not sketched. Howeve