GITTA-Logo
PDF Version of this document Search Help

Lesson Navigation IconTerrain analysis (intermediate)

Unit Navigation IconApplications in hydrology

LO Navigation IconGrids vs. TIN’s

LO Navigation IconDrainage networks

LO Navigation IconIssues and alternative approaches

LO Navigation IconInformation derived from a drainage network

LO Navigation IconQuestions

LO Navigation IconMultiple choice quiz

LO Navigation IconSummary

Unit Navigation IconVisibility analysis and related topics

Unit Navigation IconBibliography

Unit Navigation IconMetadata


GITTA/CartouCHe news:


Go to previous page Go to next page

Drainage networks

The basis for the derivation of many hydrologic parameters is a drainage network, which can manually be digitised into a grid or extracted automatically. The latter is usually the case. You will learn how to do this in the following sections. Local drain directions (i.e. flow directions) in grids are often coded according to the numeric pad on a computer keyboard. A cell discharging southwest would therefore be allocated the value 1, a cell discharging west would be allocated the value 4 and so on.

Local drain directions in a raster can be represented by the numbers on a keyboard.Local drain directions in a raster can be represented by the numbers on a keyboard.

A map assigning a local drain direction to each grid point is called a local drain direction net or ldd net (Burrough et al. 1998). Various algorithms exist for computing ldd nets, each based on different assumptions on the drainage of water in the terrain.

D8 Algorithm

The D8 algorithm is based on the quite strict assumption, that within a window of 9 cells water always flows in the direction of the steepest slope. I.e. the slope to each of the 8 neighbours of a central source cell has to be computed using the following formula:

where d is the distance and Δ z is the elevation difference between two grid points. In a raster, where the cell width is 1 we have to distinguish between two cases:

  • If we calculate the slope in the direction of north, east, south, or west, the distance d between the grid points is 1.
  • If we want to calculate the slope in diagonal directions (northeast, southeast, southwest, northwest), the distance d between the grid points is 2 .

Find the direction of flow

Let’s have a look at the following example, where the source cell and its 8 neighbours have defined elevation values and the cell size is 1, 2 or 3. Where does the water drain to? Select the correct cell by clicking on it. (Attention: this little interactive demonstration is not perfect. Where two cells might serve as target cells equally, there is no special solution implemented - the application simply chooses the first of these two cells in a sequence!)

Excersise for finding the steepest slope among 8 neighbors

The local drain direction net - ldd net

We now know how to calculate the local drain direction for a single cell in the center of a window of 9 cells. By moving the window stepwise through the entire map we can assign a local drain direction to every cell and get a "local drain direction net" or "ldd net" at the end.

Local drain direction net (ldd net) for a small DTM. Left: Local drain directions coded as arrows. Right: Local drain directions coded according to the numeric pad on a computer keyboard.Local drain direction net (ldd net) for a small DTM. Left: Local drain directions coded as arrows. Right: Local drain directions coded according to the numeric pad on a computer keyboard.

The example illustration of the flow directions below shows a 25m raster DHM from the Tuerlersee area and the flow direction map derived from it. The area of the lake in the southern part of the map had to be excluded because the drain direction on a horizontal plain is undefined.

Flow directions derived from a 25m raster DHM by using a D8 algorithm.Flow directions derived from a 25m raster DHM by using a D8 algorithm. (Swisstopo 1991)

An ldd net can alternatively be visualised with a vector map as shown in the following image.

An ldd net as a vector map.An ldd net as a vector map.
Top Go to previous page Go to next page