31.01.2013 Views

Horton manual.pdf - Università di Trento

Horton manual.pdf - Università di Trento

Horton manual.pdf - Università di Trento

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

The HORTON machine:<br />

a system for DEM analysis<br />

The reference <strong>manual</strong><br />

by<br />

R. Rigon, E. Ghesla, C. Tiso, A. Cozzini<br />

May 2006


Cover image: Scheidegger 1967, Scheidegger’s network, created by Riccardo Rigon with Matematica c○<br />

ISBN 10: 88-8443-147-6<br />

ISBN 13: 978-88-8443-147-9


Readme!<br />

This ebook was written by Riccardo Rigon and his collaborators (<strong>Università</strong> degli Stu<strong>di</strong> <strong>di</strong> <strong>Trento</strong>, Di-<br />

partimento <strong>di</strong> Ingegneria Civile e Ambientale).<br />

free:<br />

It is <strong>di</strong>stribute along the license CREATIVE COMMONS deed: Attribution - No Derives 2.5 You are<br />

• to copy, <strong>di</strong>stribute, <strong>di</strong>splay, and perform the work<br />

• to make commercial use of the work<br />

Under the following con<strong>di</strong>tions:<br />

• Attribution. You must attribute the work in the manner specified by the author or licensor.<br />

• No Derivative Works. You may not alter, transform, or build upon this work.<br />

• For any reuse or <strong>di</strong>stribution, you must make clear to others the license terms of this work.<br />

• Any of these con<strong>di</strong>tions can be waived if you get permission from the copyright holder.<br />

Your fair use and other rights are in no way affected by the above. This is a human-readable summary<br />

of the Legal Code (the full license): http://creativecommons.org/licenses/by-nd/2.5/legalcode


Contents<br />

Contributions 1<br />

1 Geomorphometry 5<br />

2 DEM manipulation 7<br />

2.1 MARK OUTLETS (h.markoutlets) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10<br />

2.2 PITSFILLER (h.pitfiller) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11<br />

2.3 SPLIT SUBBASIN (h.splitsubbasin) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13<br />

2.4 WATEROUTLET (h.wateroutlet) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15<br />

3 The basic topographic attributes 17<br />

3.1 Primary topographic attributes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17<br />

3.1.1 Gra<strong>di</strong>ents, Slopes, and Aspect . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17<br />

3.1.2 Curvature and Laplace operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19<br />

3.2 Main derived topographic properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20<br />

3.2.1 Drainage <strong>di</strong>rections<br />

after [55] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20<br />

3.2.2 Upslope catchment areas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24<br />

3.3 Ab (h.Ab) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27<br />

3.4 ASPECT (h.aspect) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31<br />

3.5 CURVATURES (h.curvatures) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33<br />

3.6 DRAINDIR (h.drain<strong>di</strong>r) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35<br />

3.7 FLOW DIRECTIONS<br />

(h.flow<strong>di</strong>rections) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38<br />

3.8 GRADIENTS (h.gra<strong>di</strong>ent) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40<br />

3.9 MULTITCA (h.multitca) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42<br />

3.10 NABLA (h.nabla) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44<br />

3.11 SLOPE (h.slope) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47<br />

i


Contents<br />

3.12 TOTAL CONTRIBUTING AREA<br />

(h.tca) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49<br />

3.13 TOTAL CONTRIBUTING AREA 3D<br />

(h.tca3D) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51<br />

4 Basin related analyses 53<br />

4.1 DIAMETERS (h.<strong>di</strong>ameters) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53<br />

4.2 DIST EUCLIDEA (h.<strong>di</strong>st euclidea) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56<br />

4.3 PRINCIPAL AXES (h.principal axes) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58<br />

4.4 MEAN DROP (h.mean drop) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59<br />

5 Network related measures 61<br />

5.1 The Hack’s length and the Width function . . . . . . . . . . . . . . . . . . . . . . . . . . . 63<br />

5.2 D2O (h.D2O) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64<br />

5.3 D2O3D (h.D2O3D) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66<br />

5.4 DD (h.DD) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68<br />

5.5 EXTRACT NETWORK<br />

(h.extractnetwork) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70<br />

5.6 HACKLENGTHS (h.hacklength) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72<br />

5.7 HACKLENGTH3D (h.hacklengths3D) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74<br />

5.8 HACKSTREAM (h.hackstream) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76<br />

5.9 LANGBEIN (h.langbein) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78<br />

5.10 MAGNITUDE (h.magnitudo) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79<br />

5.11 NET DIFF(h.net<strong>di</strong>f) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81<br />

5.12 NETNUMBERING (h.netnumbering) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83<br />

5.13 RESCALED DISTANCE<br />

(h.rescaled<strong>di</strong>stance) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85<br />

5.14 RESCALED DISTANCE 3D<br />

(h.rescaled<strong>di</strong>stance3D) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87<br />

5.15 STRAHLER (h.strahler) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89<br />

5.16 SEOL (h.seol) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91<br />

6 Hillslope analisys 93<br />

6.1 Definitions and main properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93<br />

6.2 Hillslope2ChannelDistance<br />

(h.h2cD) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97<br />

ii


6.3 Hillslope2ChannelDistance3D<br />

Contents<br />

(h.h2cD3d) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99<br />

6.4 Hillslope2ChannelAttribute<br />

(h.h2cA) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101<br />

6.5 Classification and ordering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103<br />

6.6 GC (Geomorphic classes) (h.gc) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104<br />

6.7 TC (TopographicClasses) (h.tc) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108<br />

7 Statistics 111<br />

7.1 SUMDOWNSTREAM<br />

(h.sumdownstream) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111<br />

7.2 COUPLEDFIELD MOMENTS<br />

(h.cb) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113<br />

8 Hydro-geomorphic Indexes and relations 115<br />

8.1 TOPOGRAPHIC INDEX<br />

(h.topindex) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117<br />

9 Geomorphology 119<br />

9.1 TAU (h.tau) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119<br />

9.2 SHALSTAB (r.shalstab.ft) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121<br />

9.3 SOIL DEPTH (r.soil depht.ft) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123<br />

Appen<strong>di</strong>x A 125<br />

List of figures 127<br />

Bibliografy 129<br />

iii


Contents<br />

iv


Contributions<br />

Although the present handbook is e<strong>di</strong>ted by the authors listed, the applications presented are the product<br />

of the work of some more people, here listed in chronological order: Riccardo Rigon, Paolo D’Odorico,<br />

Paolo Verardo, Marco Pegoretti, Andrea Cozzini, Silvano Pisoni, Scott Overton, Andrea Antonello, Erica<br />

Ghesla. The illustration of each application contains more details regar<strong>di</strong>ng specific contributions. Please<br />

when using the <strong>Horton</strong> Machine, cite this <strong>manual</strong> and the original references listed in the text.


General information<br />

The suite of HORTON programs is composed by a set of applications, i.e. a set of programs which carry<br />

out some operations (on <strong>di</strong>gital data of the terrain), and by the source code generating these applications. It<br />

was developed by or under the supervision of Riccardo Rigon at the Department of Civil and Environmenta<br />

Engineering of the University of <strong>Trento</strong> (ITALY). The programs are available accor<strong>di</strong>ng to the GPL (General<br />

Public License) and can be found at (http://www.gnu.org/copyleft/gpl.html).<br />

The code contained in HORTON, originally based on the fluidturtle C libraries, also available accor<strong>di</strong>ng<br />

to the GPL, has been recently ported completely to Java and works inside the GIS JGRASS. The original<br />

version of the routine is not anymore maintained since 2003.<br />

The programs contained in HORTON generally use the RAM memory intensely. Although we try to<br />

use the memory in a rational way (but not always), neither particular instruments nor particular codexes (to<br />

improve, for example, the allocation of the matrix memory) have been optimized: this would have pushed<br />

us dangerously far away from the purposes on which these libraries have been built, namely having the<br />

geomorphology analysis instruments to use and mo<strong>di</strong>fy easily. The main criterion for the <strong>Horton</strong> Programs<br />

design has been the creation of an easily readable, modular and reusable code. The rest, also efficiency, is<br />

subor<strong>di</strong>nate.


To begin<br />

The understan<strong>di</strong>ng of some basic elements of the GIS JGrass is necessary in order to use the <strong>Horton</strong><br />

Machine: you will find a complete description in the JgrassManual which is downloadable at the site<br />

http://www.hydrologis.com.<br />

A basic knowledge of geomorphometry is also needed. However, a minimal explanation of the contents<br />

of the single chapters is provided at the beginning, whereas next chapter briefly introduces the topics. A<br />

comprehensive introduction to geomorphometry literature, yet to be completed with [65], and related work,<br />

is [57].<br />

The following chapter 1 contains a very brief introduction to geomorphometry.<br />

Chapter 2 contains the basic tools for DEM manipulation; chapter 3 the analysis of slopes, gra<strong>di</strong>ents,<br />

curvatures, contributing areas and drainage <strong>di</strong>rections; chapter 4 various tools from Riccardo Rigon research;<br />

chapter 5, classic and less classic classification of river networks; chapter 6 some tools for hillslope metric<br />

analysis (length, drainage density and so on), chapter 7 some tools for geometric characterization based on<br />

the geometry of sites; chapter 8 deals with some tools prepared for the statistical analysis of the geomorphic<br />

properties; in chapter 9 some geomorpic and hydrologic indexes are described. Finally, some tools for<br />

hillslope stability and soild depth are presented.<br />

JGRASS as well as The <strong>Horton</strong> Machine inherits the FluidTurtle file format which is explained in the<br />

Appen<strong>di</strong>x A.


For each application in the <strong>Horton</strong> machine a brief description is given accor<strong>di</strong>ng to scheme here after<br />

presented.<br />

HERE THE PROGRAM NAME<br />

Description: it contains a brief description of what the program does.<br />

Author and date: the author of the source code and of the following mo<strong>di</strong>fiers.<br />

Inputs: It describes the data requested by the program in input. This data are contained in a file (the file<br />

called ’nome’ is given as an example). If data are provided also interactively, this are specified with<br />

enumeration. The example files contain comments concerning their contents. As a rule, the <strong>Horton</strong><br />

application code contains a ”main( )” executing all the I/O operations and a routine which, operating<br />

on matrixes and vectors, executes the calculus; in<strong>di</strong>cations regar<strong>di</strong>ng the matrix content can be found<br />

also in the comments of the source code.<br />

Returns: Dealing with an application, generally the content of the output file is specified. Instead, if it were<br />

a routine, we would deal with data and control values.<br />

JGRASS Command: the syntax of the command given on the command line.<br />

Notes: Notes about the program. Specially concerning its limitations (no code is perfect!) or the algorythms<br />

used within the routine. A wish-list for the future versions and/or other information.<br />

References: Articles or books which have inspired the codex or justified its necessity. Users are encouraged<br />

to cite these papers in their own work.<br />

Sources: All the sources necessary to the codex compilation, except for the basis routines (specified in the<br />

appen<strong>di</strong>xes). A more detailed documentation about the codex can be found in the source files and can<br />

be extracted with doxygen.


1 Geomorphometry<br />

The purpose of this analysis is to describe some quantitative instruments for understan<strong>di</strong>ng the morphol-<br />

ogy of catchments. Indeed, the object of geomorphometry is characterizing quantitatively the morphology<br />

of the Earth’s surface, and of the topographical properties of the basins, in order to device some in<strong>di</strong>cators<br />

of hydrologic and erosive processes and some instruments for a correct parametrization of the hydrologic<br />

simulation models.<br />

In the recent past and in the tra<strong>di</strong>tional geomorphologic practice, the characters of topography were derived<br />

through field investigations and aerial photos; the morphology of topographic surfaces was synthetized in<br />

some shape parameters and the channel network was described accor<strong>di</strong>ng to either Sthraler’s or <strong>Horton</strong>’s<br />

schemes [65]. Now, the availability of <strong>di</strong>gital elevation models (DEM) has irreversibly changed the analysis<br />

of mountain geomorphology, and above all of the geomorphology at basin scale. Indeed, it has made it<br />

possible to shift from a substantial lack to an abundance of data and from <strong>manual</strong> processing to automatic<br />

analysis, starting from Moore’s works (for a complete bibliography see Wilson and Gallant, 2000 [13]),<br />

Tarboton et al. [1989] [75], Jenson and Domingue [1988] [67], Jenson [1991] [70], Band [1993a] [7],<br />

Montgomery and Foufula-Georgiou [48], Costa Cabral e Burges [1994] [41], Garbrecht and Martz [1997]<br />

[18]. Nowadays the automatic analysis of topography enables to obtain reliable results and to estimante<br />

a lot of quantitative information. Some issues, like the determination of the beginning of the channel in-<br />

cision, still remain open. Moreover, although the tra<strong>di</strong>tional methodologies for technological reason can<br />

work only with synthesis parameters [Abrahams, 1984 [1]], the modern analysis, supported by the use of<br />

Geographic Information Systems (GIS), can easily deal with <strong>di</strong>stributions of the same parameters and can<br />

also inquire <strong>di</strong>rectly into many quantities once inaccessible to geomorphologues [Rinaldo et al., 1998 [4];<br />

Rodriguez-Iturbe and Rinaldo, 1997 [65]], i.e. the mean length of a basin hillslopes [D’Odorico and Rigon]<br />

[11]. The relations existing between some classical geomorphologic in<strong>di</strong>cators, like for instance <strong>Horton</strong>’s<br />

and Sthraler’s numbers and the <strong>di</strong>stributed quantities are analyzed by [68] and [69] .<br />

In this report we analyse the statistic properties of the elementary (or primary) topographic quantities of<br />

the sample basins chosen for this convention.<br />

The topographic properties analyzed by The <strong>Horton</strong> Machine can be <strong>di</strong>stinguished in:<br />

• primary topographic attributes (elevations, slopes and curvatures)<br />

• main derived properties (contributing areas and drainage lengths)


1. Geomorphometry<br />

• hydro-morphological indexes and curves (topographic index, proxies of the bottom shear stress gen-<br />

erate by surface water flow and <strong>di</strong>stance from the network and from the outlet)<br />

The cartography and the <strong>di</strong>stribution and probability curves of all primary quantities are here after reported.<br />

As an example, the Flanginec river in Trentino (ITALY) is used. The original map was obtained by<br />

coarse graining a LIDAR data set to a raster of 5 m side and is available with JGRASS.<br />

6


2 DEM manipulation<br />

Figure 2.1: Models for structuring a network of raster elevation data: (a) squared network obtained by moving a submatrix 3 × 3<br />

centered on the nodes; (b) triangulated irregular network-TIN; (c) network based on the contour lines. The contour lines can be<br />

used afterwards to sub<strong>di</strong>vide the area in irregular polygons together with the lines of maximum slope (which constitute the envelope<br />

of gra<strong>di</strong>ents) orthogonal to them [Moore and Grayson, 1990, Palacios and Cuevas, 1989; Moore, 1988; Moore and Grayson, 1989,<br />

1990].<br />

Topography is conceived by a bivariate continuous function<br />

and with continuous derivative up to the second order almost everywhere.<br />

z = f(x, y) (2.1)<br />

The representation of the data, on a regular rectangular grid, constitutes undoubtedly the most common<br />

and most efficient way in which the terrain <strong>di</strong>gital data can be <strong>di</strong>vided. Their <strong>di</strong>rect treatment though can<br />

produce some problems in the determination of very strong elevation changes, and in the treatment of the<br />

flows in the <strong>di</strong>verging zones, which will be later <strong>di</strong>scussed. The data presented in this raster, can be stored<br />

in <strong>di</strong>fferent ways, but the most efficient is the report of the vertical coor<strong>di</strong>nate z for a subsequent series of<br />

points along a given regular spacing profile. The elementary area is the one composed by four adjacent<br />

points (three in the case of a regular grid) and consequentely the surface is <strong>di</strong>scretized in elements (pixels)<br />

centered in the grid nodes to which is attributed an elevation equal to their barycenter or, accor<strong>di</strong>ng to the<br />

cases, to the mean elevation of the area. In other words, the elevation field constitutes a matrix of m × n<br />

elements, each being the elevation of the point considered.<br />

The minimum scale, i.e. the pixel size necessary for a correct representation of the terrain from the hy-<br />

drologic point of view, depends on the ongoing morphologic processes. Normally pixels with a 10-m-long<br />

side are assumed to be sufficient to identify most geomorphologic in<strong>di</strong>cators [Montgomery and Foufola-<br />

Geourgiou, 1993] however a finer resolution should be considered when available. However depen<strong>di</strong>ng on


2. DEM manipulation<br />

the processes stu<strong>di</strong>ed, the problem is to know the procedure which produced the DEM from tra<strong>di</strong>tional topo-<br />

graphic measures or other sources. The correct reproduction of second order derivatives (i.e. of curvatures),<br />

which are the mirror of the physical processes acting, has to be considered.<br />

The representation of a typical mountain topography from a DEM is depicted in Figure 2.2. Figure 2.3<br />

shows the statistics of the same dataset as probability of exceedence of a given height. Also other statistics,<br />

like the hypsographic curves, are often used in geomorphology (e.g. - [43], pp 211).<br />

Figure 2.2: Topography of Flanginec basin<br />

8


2. DEM manipulation<br />

Figure 2.3: Statistics of the elevations of river Flanginec. For each elevation value the portion of area with highest elevation can<br />

be read in or<strong>di</strong>nate<br />

9


2. DEM manipulation<br />

2.1 MARK OUTLETS (h.markoutlets)<br />

description: It ”marks” the basin outlets with conventional number 10. In fact some applications in HOR-<br />

TON request that the outlets are specified explicitly.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon, 1998<br />

Inputs:<br />

1. file containing the matrix of the drainage <strong>di</strong>rections to mo<strong>di</strong>fy (obtained with flow<strong>di</strong>rections or<br />

Output:<br />

drain<strong>di</strong>r);<br />

1. file containing the matrix of the data assigned in input with the outlets set equal to 10;<br />

JGRASS Command: h.markoutlets [–quiet] [–verbose] [–version] [–usage] –flow –inmapset <br />

[–inputformat ] –mflow –mflowmapset [–mflowformat<br />

] [–usegui]<br />

Notes: It follows the drainage <strong>di</strong>rections until it finds a value greater than 8. Then it marks the point <strong>di</strong>rectly<br />

upriver as outlet.<br />

Sources: h markoutlets.java<br />

10


2.2 PITSFILLER (h.pitfiller)<br />

2. DEM manipulation<br />

Description: It fills the depression points contained in a DEM so that the drainage <strong>di</strong>rections are defined in<br />

each point. See, for instance [7] for a <strong>di</strong>scussion of this and related issues.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, M. Pegoretti, Paolo Verardo & Riccardo Rigon, 1998.<br />

Inputs:<br />

1. the file containing the elevations;<br />

Output:<br />

1. matrix of the correct elevations;<br />

JGRASS Command: h.pitfiller [–quiet] [–verbose] [–version] [–usage] –elevation –inmapset<br />

[–inputformat ] –pit –outmapset [–outputformat<br />

] [–usegui]<br />

Notes: The floo<strong>di</strong>ng algorythm (pitsfiller) fills all pits present in the DEM. Obviously these could also be<br />

real pits and not a product of the landscape grid<strong>di</strong>ng. In this case we should find a representation of<br />

the drainage <strong>di</strong>rections considering also the possible lakes and ponds, which is not yet implemented<br />

References: [75] [56]<br />

Sources: h pitfiller.java<br />

See Also: DrainageDirections<br />

11


2. DEM manipulation<br />

Figure 2.4: The map of elevations without pit, calculated on the Flanginec river basin.<br />

12


2.3 SPLIT SUBBASIN (h.splitsubbasin)<br />

2. DEM manipulation<br />

Description: A tool for labeling the subbasins of a basin. Given the Hack’s number of the channel network,<br />

the subbasin up to a selected order are labeled. As shown in Figure 2.6 where Hack order 2 was<br />

selected, the subbasins of Hack order 1 and 2 and the network of the same order are extracted<br />

Author and date: Erica Ghesla, & Riccardo Rigon, 2005<br />

Inputs:<br />

1. the file containing the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file of the order accor<strong>di</strong>ng the Hack lengths;<br />

3. the file containing the contributing area (obtained with drain<strong>di</strong>r or tca);<br />

4. the threshold value for the contributing area;<br />

5. the hackstream order file;<br />

Output:<br />

1. the file containing the net with the streams numerated;<br />

2. the file containing the subbasins.<br />

JGRASS Command: h.splitsubbasin [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

[–flowformat ] –hackstream –hackstreammapset


2. DEM manipulation<br />

Figure 2.5: The subbasins calculated on the Flanginec river basin. Hachstream = 2.<br />

14


2.4 WATEROUTLET (h.wateroutlet)<br />

2. DEM manipulation<br />

Description: Generates a watershed basin mask from a drainage <strong>di</strong>rection map and a set of coor<strong>di</strong>nates<br />

representing the outlet point of watershed.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Francesch, Erica Ghesla, Silvano Pisoni, Ric-<br />

cardo Rigon. Originally by Charles Ehlschlaeger, U.S. Army Construction Engineering Research<br />

Laboratory.<br />

Inputs:<br />

1. the map containing the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the coor<strong>di</strong>nates of the water outlet;<br />

3. the map containing the channel network (obtained with extractnetwork);<br />

Output:<br />

1. he basin extracted mask;<br />

2. a chosen map cut at the basin mask (the name assigned is input.mask).<br />

JGRASS Command: h.wateroutlet [–quiet] [–verbose] [–version] [–usage] –drainage –basin<br />

–northing –easting [–extractmap ] [–usegui]<br />

Notes: The most important thing in this module is to choose a good water outlet. If the coor<strong>di</strong>nates are<br />

unknown, clic with the mouse on the network map.<br />

References: This <strong>manual</strong>.<br />

Sources: h wateroutlet.java<br />

See Also: FlowDirections<br />

15


2. DEM manipulation<br />

Figure 2.6: The map containing the basin.<br />

16


3 The basic topographic attributes<br />

The primary topographic attributes are:<br />

• aspect;<br />

• slopes and gra<strong>di</strong>ent;<br />

• Laplace operator;<br />

• longitu<strong>di</strong>nal, trasversal and normal curvatures;<br />

The main derived quantities are:<br />

• up-slope catchment areas;<br />

• drainage <strong>di</strong>rections.<br />

3.1 Primary topographic attributes<br />

3.1.1 Gra<strong>di</strong>ents, Slopes, and Aspect<br />

The slope <strong>di</strong>stribution is relevant from many points of view. Since the main motive-power of the hydro-<br />

logic flows on the Earth’s surface and in the soil <strong>di</strong>rectly below is gravity, the surface gra<strong>di</strong>ent identifies,<br />

in first approximation, the water flow <strong>di</strong>rections and contributes to the determination of their speed. The<br />

sub-surface flow is proportional to slope; the surface runoff to the root of the slope. Also the erosion and<br />

the consequent solid transport depend on the gra<strong>di</strong>ents of the topographic surfaces: these have components<br />

which are proportional to the gra<strong>di</strong>ents both in a linear and in a non-linear way [e.g. [12]]; moreover, zones<br />

with a great slope are generally devoid of soil and they represent zones of exposed rock.<br />

In<strong>di</strong>cating with:<br />

fx = ∂z<br />

∂x<br />

fy = ∂z<br />

∂y<br />

(3.1)


3. The basic topographic attributes<br />

and:<br />

• The gra<strong>di</strong>ent is:<br />

• the maximum-slope (the slope) angle is:<br />

p = f 2 x + f 2 y<br />

• and the aspect (measured counterclockwise from the ”x” axis) is:<br />

(3.2)<br />

∇z = (fx, fy) (3.3)<br />

γ = arctan √ p (3.4)<br />

α = arctan fy<br />

From slopes, we deduce the drainage <strong>di</strong>rections which correspond (up to inertial effects negligible at first<br />

approximation) to the water flows.<br />

fx<br />

Figure 3.1: The slope of Flanginec basin<br />

The flow <strong>di</strong>rections are determined in the <strong>di</strong>rection of maximum slope yet, in practice, the possible<br />

drainage <strong>di</strong>rections are limited to the <strong>di</strong>scretization adopted in order to represent the real data. Indeed, each<br />

pixel is surrounded by a set of other points, four, six or eight, accor<strong>di</strong>ng to the fine topologic structure chosen<br />

and each represented in Figure (3.2).<br />

18<br />

(3.5)


3. The basic topographic attributes<br />

Figure 3.2: Diagram of the possible topologies of river basin <strong>di</strong>scretization: (a) isotropic hexagonal structure; (b) isotropic squared<br />

four-<strong>di</strong>rection structure; (c) eight-<strong>di</strong>rection squared structure (isotropic or not, depen<strong>di</strong>ng on how the <strong>di</strong>agonal <strong>di</strong>rections are<br />

weighted, i.e. topologically or geometrically)<br />

Since the terrain <strong>di</strong>gital data used by the programs described in this <strong>manual</strong> are provided on the basis<br />

of matrixes whose elements (the pixels) are squared, during the present work the eight-<strong>di</strong>rection topology<br />

is normally adopted. Such choice makes it possible to <strong>di</strong>scriminate sufficiently among the various <strong>di</strong>rec-<br />

tions, with no need to use a continuous representation of the surface, even if the limitation entails some<br />

compromises [[55] and references therein]. The aspect is then often substituted by numbers (from 1 to 8) as<br />

represented in Figure (3.2c).<br />

3.1.2 Curvature and Laplace operator<br />

The curvatures represent the deviations of the gra<strong>di</strong>ent vector for unit length (in ra<strong>di</strong>ants) along particular<br />

curves plotted on the surface under consideration. In particular, the presence of non-zero curvatures has<br />

relevant effects on the representation of the properties of the surfaces <strong>di</strong>scretized. For example, if the surface<br />

has a negative normal curvature, then the gra<strong>di</strong>ents have <strong>di</strong>verging <strong>di</strong>rections at the extremes of the pixel,<br />

P , and the contributing area in P is spread over several adjacent pixels: in this case topography is called<br />

locally <strong>di</strong>vergent. Vice versa, the surface is locally converging (negative curvature) and the contributing<br />

area in P tends to be spread over a limited set of adjacent pixels and almost centainly on a single pixel.<br />

19


3. The basic topographic attributes<br />

Roughly speaking, the convex zones are hillslope zones, the concave zones are valleys. As it is known, the<br />

latter contain the channel network. Then, the curvature tends to <strong>di</strong>scriminate the points across the basin with<br />

greater humi<strong>di</strong>ty content (the concave ones). This fact has relevant consequences on the overall hydrologic<br />

behavior of basins and, in particular, on the production of runoff and on the evapotranspiration <strong>di</strong>stribution.<br />

The Laplace operator, which here represents the curvature, is defined by:<br />

∇ 2 z = ∂2 2<br />

z<br />

∂x<br />

+ ∂2 2<br />

z<br />

∂y<br />

and it makes it possible to <strong>di</strong>stinguish the convex zones (∇ 2 z < 0) from concave zones (∇ 2 z > 0) or<br />

planar zones (∇ 2 z ∼ 0). Although, from a geometric <strong>di</strong>fferential point of view, it is possible to determine<br />

a classification of topography, based on the combination of curvatures (see TC and GC), a simpler partition<br />

of the landscape can based on the Laplace operator. Indeed, the terrain <strong>di</strong>gital data produced with the<br />

tra<strong>di</strong>tional techniques, do not return really reliable values of the curvature; on the contrary, the sign of the<br />

Laplace operator is instead sufficiently correct.<br />

3.2 Main derived topographic properties<br />

3.2.1 Drainage <strong>di</strong>rections<br />

after [55]<br />

The basic operation that must be carried out when processing DEM data is the determination of drainage<br />

<strong>di</strong>rections. This operation has important implications on the calculation of drainage areas and other quanti-<br />

ties required for the description of a drainage system [e.g. [6], [39]]. The earliest and simplest method for<br />

specifying drainage <strong>di</strong>rections is to assign a pointer drom each DEM cell to one of its eight neighbors, either<br />

adjacent or <strong>di</strong>agonal in the <strong>di</strong>rection of the steepest downward slope. This method was introduced by [54]<br />

and [44] and is commonly known as D8 (eight drainage <strong>di</strong>rections). The D8 approach is characterized by<br />

two major restrictions: (1) the drainage <strong>di</strong>rection from each cell is restricted to eight possibilities, separated<br />

by θ = π/4 rad (square cells are used: see also [15];[58], [41]) and (2) drainage area (see below) which<br />

orignates over a two <strong>di</strong>mensional cell is treated as a point-source (non<strong>di</strong>mensional) and is projected downs-<br />

lope by a line (one <strong>di</strong>mensional) [50]. To overcome these two restrictions <strong>di</strong>fferent alternative methods have<br />

been developed [55] but in the <strong>Horton</strong> Machine only variations on D8 method has been fully implemented<br />

so far.<br />

20<br />

(3.6)


3. The basic topographic attributes<br />

Accor<strong>di</strong>ng to D8, a river basin is well defined from the numeric point of view if any point across the basin<br />

except for the basin closure, has a lower point around itself. The points belonging to lakes or ponds and the<br />

natural depressions constitute exceptions to this situation. The lakes are identified in the DEM in advance<br />

(since they constitute a connected set of points of which the elevation -constant- and the location of one<br />

point at least are known), while the smaller depressions are filled artificially until they identify a drainage<br />

<strong>di</strong>rection [[75]; [56]]. Problems can be given also by flat areas where no clear gra<strong>di</strong>ent is presented. [18]<br />

suggested a method to overcome these situations.<br />

Defining the drainage <strong>di</strong>rections causes each pixel to be connected to the outlet and each pixel to be<br />

an ”upriver” basin outlet univocally defined. Accor<strong>di</strong>ng to the criterion of maximum slope, every element<br />

drains towards the lowest element nearby. This usually does not coincide with the <strong>di</strong>rection of the gra<strong>di</strong>ent<br />

and a new method to minimize this deviation was proposed in [55]. In case the sites are <strong>di</strong>stinguished with<br />

indexes on the basis of a pre-established numeration, it is possible to express the drainage <strong>di</strong>rections through<br />

a matrix W , whose element is Wij, defined by the relation:<br />

and also:<br />

Wij =<br />

being nn(i) the set of the elements surroun<strong>di</strong>ng i.<br />

A correction to the D8 method<br />

�<br />

1 if j drains in i<br />

0 otherwise<br />

(3.7)<br />

Wij = 1 se zj = min{zk k ∈ nn(i)} (3.8)<br />

Using the ”pure” D8 method for the drainage <strong>di</strong>rection estimation causes an effect of deviation from<br />

the real <strong>di</strong>rection identified by the gra<strong>di</strong>ents. Some authors, e.g. [15], claim that, in nature, there is also a<br />

<strong>di</strong>spersive effect due to the subgrid variation of the gra<strong>di</strong>ents along the finite size of pixels, but this effect is<br />

usually negligible in most of the real cases.<br />

[16] chose the drainage <strong>di</strong>rection accor<strong>di</strong>ng to the following scheme. Being<br />

ei (i = 0, 1, 2, ...) (3.9)<br />

the vector containing the elevation of the eight pixels surroun<strong>di</strong>ng one given pixel, and<br />

<strong>di</strong> (i = 0, 1, 2, ...) (3.10)<br />

the vector containing the pixel <strong>di</strong>stances (greater for the pixel in the corner <strong>di</strong>rections). The above situation<br />

is shown in figure 3.3. Joining the eight neighbors with the central pixels, eight triangle are created and<br />

21


3. The basic topographic attributes<br />

the gra<strong>di</strong>ent vector is inside one of them. The gra<strong>di</strong>ent vector deviates from the side of the triangle which<br />

represent two choices (p1 and p2) for a possible <strong>di</strong>rection in the tra<strong>di</strong>tional D8 method. The Tarboton’s<br />

method chose the <strong>di</strong>rection among the two which is closer the the real gra<strong>di</strong>ent <strong>di</strong>rection.<br />

Figure 3.3: The drainage <strong>di</strong>rections represented with reference to a generic pixel, i, in<strong>di</strong>cated here with “0”. In red, is shown the<br />

gra<strong>di</strong>ent <strong>di</strong>rection, in blue are the eight surroun<strong>di</strong>ng triangles, in green a linear estimation of the deviation of the gra<strong>di</strong>ent from the<br />

side <strong>di</strong>rection and in pink an angular estimation of the same quantity.<br />

For each triangle the slope of the sides s1 and s2 is:<br />

s1 = e0 − e1<br />

d1<br />

s2 = e1 − e2<br />

d2<br />

The aspect of the gra<strong>di</strong>ent (i.e. its angular orientation), r,and its modulus, smax are:<br />

r = arctan<br />

smax =<br />

� �<br />

s2<br />

s1<br />

�<br />

s 2 1 + s 2 �1/2 1<br />

(3.11)<br />

(3.12)<br />

(3.13)<br />

(3.14)<br />

The deviation of the sides from the gra<strong>di</strong>ent can be expressed in two ways as in [55]. We can consider<br />

the angle between the aspect and the sides (α1 and α2 in figure 3.3) or the <strong>di</strong>stance between the center of<br />

22


3. The basic topographic attributes<br />

the pixel and the line along the gra<strong>di</strong>ents (δ1 and δ2 in figure 3.3). The first criterion implemented, D8-<br />

LAD (least angular deviation), minimize the total angular deviation, the second criterion, D8-LTD (least<br />

trasversal deviation), minimizes the total deviation length. The angular deviations are:<br />

α2 = arctan<br />

α1 = r (3.15)<br />

� d2<br />

The chosen <strong>di</strong>rection is p1 if α1 ≤ α2 or the <strong>di</strong>agonal p2 if α1 > α2.<br />

The transversal deviation are:<br />

δ2 =<br />

d1<br />

δ1 = d1 sin α1<br />

�<br />

d 2 1 + d 2 �1/2 1 sin α2<br />

�<br />

− r (3.16)<br />

(3.17)<br />

(3.18)<br />

In the D8-LAD method, the <strong>di</strong>rection p1 is chosen of δ1 ≤ δ2 or p2 is chosen otherwise. Both the method<br />

gives a drainage <strong>di</strong>rection for any DEM cell. Besides, they can provide the estimation of the total deviation<br />

from the gra<strong>di</strong>ents, just cumulating the angular or the linear deviation going from the higher pixel downhill.<br />

The core of the new method is to to re<strong>di</strong>rect the D8 drainage <strong>di</strong>rection if use the total deviation (either<br />

angular or linear) is larger than an assigned threshold value. For the k pixel, deviation are:<br />

with<br />

The cumulative total deviations are:<br />

δ2(k) =<br />

δ1(k) = d1 sin α1<br />

�<br />

d 2 1 + d 2 �1/2 1 sin α2<br />

(3.19)<br />

(3.20)<br />

δ + 1 (k) = σδ1(k) + λδ + (k − 1) (3.21)<br />

δ + 2 (k) = −σδ2(k) + λδ + (k − 1) (3.22)<br />

where σ is the sign given to any <strong>di</strong>rection and λ is a factor which the user can choose between 0 and 1.<br />

As an example, the drainage <strong>di</strong>rection is chosen to minimize: Lδ + (k) where k = 1, 2, .... If δ + 1<br />

δ + 2 (k), is δ+ (k) = δ + 1<br />

(k) e p = p1;<br />

Otherwise, if δ + 1 (k) > δ+ 2 (k), is δ+ (k) = δ + 2<br />

(k) e p = p2.<br />

The other method, D8-LAD, utilizes the same procedure.<br />

(k) ≤<br />

If λ=0 the deviation’s counter has no memory and the pixel up-hill do not influence the choice. If λ=1 the<br />

total deviation is entirely recorded. For the D8-LAD λ=0 is equivalent to use the steepest descent method.<br />

23


3. The basic topographic attributes<br />

Figure 3.4: How to assign the (σ) to the eight trangles (in blue). As above, in red, is the gra<strong>di</strong>ent, dash lines delimit the eight<br />

triangles, in green is the linear deviation and in pink the angular deviation.<br />

3.2.2 Upslope catchment areas<br />

The upslope catchment (or simply contributing) areas represent the planar projection of the areas afferent<br />

to a point in the basin. Once the drainage <strong>di</strong>rections have been defined, it is possible to calculate, for each<br />

site, the total drainage area afferent to it, in<strong>di</strong>cated as TCA (Total Contributing Area). The number of sites<br />

draining in the i-esimal element determines the total area Ai which can be expressed as follows:<br />

Ai = �<br />

j ∈ nn(i)<br />

WijAj + Ri<br />

(3.23)<br />

where nn(i) represents the set of the eight (six, four or three) pixels surroun<strong>di</strong>ng the i-esimal site; Ri is<br />

the area of every pixel. The use of the method of the maximum slope, with no partition of the flow coming<br />

out from every pixel, makes the TCA an increasing function of the abscissa measured along any path from<br />

upriver downhill. The <strong>di</strong>scretized representation of the surfaces implies two principal problems: the first<br />

(and more important) one is due to a topologic limitation, i.e. to the fact that we are able to consider a<br />

limited number of drainage <strong>di</strong>rections (for example in topology D4 there are 4 <strong>di</strong>rections, with a spacing of<br />

90 degrees: North, East, South, West; in topology D8, 8 <strong>di</strong>rections, with a spacing of 45 degrees: North,<br />

24


3. The basic topographic attributes<br />

North-West, East, South-East, South, South-West, West, North-West); the second is bound to the gra<strong>di</strong>ent<br />

variation in convex zones (with <strong>di</strong>verging gra<strong>di</strong>ent). The limitation of the possible <strong>di</strong>rections entails that<br />

surfaces oriented <strong>di</strong>fferently, (for example in <strong>di</strong>rection 22 degrees) are bad represented, and systematic<br />

deviations from the <strong>di</strong>rection of the real flow can generate. The second problem is particularly relevant<br />

for hillslope or conoid zones. As already described, where the curvature is positive, the gra<strong>di</strong>ent (and the<br />

flows along with it) ”converges” towards a point; in the negative-curvature points, the gra<strong>di</strong>ent, at the pixel<br />

extremes, points to <strong>di</strong>fferent <strong>di</strong>rections: then it tends to spread the flow on several adjacent pixels. Many<br />

techniques have been implemented to compensate for these limitations in the procedures. A group of these<br />

techniques consists in <strong>di</strong>stributing the flow not in only one <strong>di</strong>rection, but in many <strong>di</strong>rections (multiple flow<br />

<strong>di</strong>rections) [15]<br />

If we adopt a multiple flow <strong>di</strong>rection criterion, the matrix W does not contain only one value <strong>di</strong>ffer-<br />

ent from zero (and equal to one), but it can present several pixels with drained value <strong>di</strong>fferent from zero,<br />

provided that the sum of the contributions due to a pixel on all its neighbors is unitary. In this case:<br />

�<br />

α ≤ 1 se j drains in i<br />

Wij =<br />

0 otherwise<br />

with:<br />

(3.24)<br />

�<br />

Wij = 1 (3.25)<br />

j<br />

The partition is usually done considering that the nearby most lowered site is that receiving most of the flow,<br />

followed by the second most lowered site and so on up to the last one, which appears as the one of greatest<br />

elevation. In formal terms:<br />

△hi<br />

Wi,j = �<br />

j ∈ pp(i) △hi<br />

where pp(i) represents the set of the close sites with a lesser elevation than the i-esimal element.<br />

(3.26)<br />

The total cumulative area is an extremely important quantity in the geomorphologic and hydrologic study<br />

of a river basin: indeed, it seems to be strictly related to the <strong>di</strong>scharge flowing into the <strong>di</strong>fferent points of the<br />

system in uniform precipitation con<strong>di</strong>tions.<br />

Recent stu<strong>di</strong>es [65] have shown that the contributing areas <strong>di</strong>stribute accor<strong>di</strong>ng to a power low:<br />

P [A > a] ∼ a −β f(a/AT ) (3.27)<br />

where AT is the area of the basin. Generally, the exponent of the probability curve is close to about β =<br />

−0.43. The the power law deviation for small areas is due to the transition between hillslopes and channeled<br />

zones. In big areas, there are not enough sample points and the <strong>di</strong>stribution tends quickly to zero (because<br />

of finite size). The function f in fact is:<br />

lim<br />

a→0 f(a/At) = 1 (3.28)<br />

lim f(a/At) = 0<br />

a→AT<br />

25


3. The basic topographic attributes<br />

Figure 3.5: Graphical elaboration of the contributing areas considering the flow accor<strong>di</strong>ng to the maximum-slope method referred<br />

to Flanginec basin.<br />

26


3.3 Ab (h.Ab)<br />

3. The basic topographic attributes<br />

Description: It calculates the draining area per length unit (A/b), where A is the total upstream area and b<br />

is the length of the contour line which is assumed as drained by the A area see fig. 3.6. The contour<br />

length is here be estimated by a a novel method based on curvatures.<br />

Author and date: Erica Ghesla & Riccardo Rigon, 2004<br />

Inputs:<br />

1. the file containing the matrix of planar curvatures (obtained with curvatures);<br />

2. the matrix with the total contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

Output:<br />

1. the file containing the matrix of the areas per length unit, A/b;<br />

2. the file containing the matrix of the contour line, b.<br />

h.aspect [–quiet] [–verbose] [–version] [–usage] –plan curv <br />

–plan curvmapset [–plan curvformat ] –tca –tcamapset<br />

[–tcaformat ] –alung<br />

–alungmapset –alungformat –b –bmapset <br />

[–bformat ] [–usegui]<br />

Note: The drainage length, b is here evaluated in each point of the basin accor<strong>di</strong>ng to the value of the planar<br />

curvature. The contour line is locally approximated by an arc having the ra<strong>di</strong>us inversely proportional<br />

to the local planar curvature. It is in fact the curvature ra<strong>di</strong>us r is:<br />

r = 1<br />

kp<br />

(3.29)<br />

where kp is the planar curvature. Then, assuming that the contour line can be approximated by a circle<br />

ra<strong>di</strong>us, it is also<br />

t = αr t ′ = α(r − L) (3.30)<br />

where t is the drained contour at the beginning (uphill) of the pixel and t ′ is the drained contour at the<br />

end of the pixel (downhill), α is the angle enclosed between the two contours as an L is the pixel size,<br />

as in figure 3.7.<br />

L, in turn can be related to α as:<br />

L = 2r sin<br />

27<br />

� �<br />

α<br />

2<br />

(3.31)


3. The basic topographic attributes<br />

and then:<br />

Substituting 3.30 in 3.32 one obtain:<br />

Finally, for every pixel, it is assumed:<br />

where b is the drained contour.<br />

� �<br />

L<br />

α = 2 arcsin<br />

2r<br />

(3.32)<br />

� �<br />

L<br />

t = 2 arcsin r t<br />

2r<br />

′ � �<br />

L<br />

= 2 arcsin (r − L) (3.33)<br />

2r<br />

b ∼ t ′<br />

(3.34)<br />

To very convergent sites, there correspond a proportionally shrinking contour line, as in figure 3.7,<br />

and to <strong>di</strong>vergent site, as opposed to what shown in figure 3.7, an enlarging drainage line.<br />

References: [51], this <strong>manual</strong>.<br />

Sources: h Ab.java<br />

See Also: TCA, CURVATURES, DRAINDIR.<br />

28


Figure 3.6: The graphical description of the area A and the length of the contour line b.<br />

Figure 3.7: The contour line in a pixel.<br />

29<br />

3. The basic topographic attributes


3. The basic topographic attributes<br />

Figure 3.8: The areas per length unit of the basin of the Flanginec river.<br />

Figure 3.9: The contour line of the basin of the Flanginec river.<br />

30


3.4 ASPECT (h.aspect)<br />

3. The basic topographic attributes<br />

Description: It estimates the aspect (i.e. the inclination angle of the gra<strong>di</strong>ent) by considering a reference<br />

system which puts the zero towards the east and the rotation angle anticlockwise. It <strong>di</strong>ffers from<br />

the drainage <strong>di</strong>rections in which it is given in ra<strong>di</strong>ants and it is a continuous function while drainage<br />

<strong>di</strong>rection returns a number between 1 and 10. In figure 3.10 is reported a pictorial view of the aspect<br />

of the basin of Flanginec river. NODATA is a negative number. The aspect is 0 in the the South<br />

<strong>di</strong>rection and increase clockwise.<br />

Author and date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2005, Andrea Cozzini,<br />

Riccardo Rigon, 2001<br />

Inputs:<br />

1. the file containing the matrix of the pitless elevations (as generated by the pitsfiller application);<br />

Output:<br />

1. the file containing the aspect matrix;<br />

JGRASS command: h.aspect [–quiet] [–verbose] [–version] [–usage] –pit –pit –pitmapset<br />

[–pitformat ] –aspect –outmapset [–outputformat<br />

] [–usegui]<br />

Note: Given the <strong>di</strong>fficulty in defining the aspect on the matrix boundary, for the pixels belonging to this<br />

we suppose that the <strong>di</strong>rection angle of the gra<strong>di</strong>ent is turned, starting from the pixel centre, along the<br />

maximum slope <strong>di</strong>rection.<br />

References: This <strong>manual</strong><br />

Sources: h aspect.java<br />

See Also: Drainage<strong>di</strong>rections<br />

31


3. The basic topographic attributes<br />

Figure 3.10: The aspect of the basin of the Flanginec river.<br />

32


3.5 CURVATURES (h.curvatures)<br />

3. The basic topographic attributes<br />

Description: It estimates the longitu<strong>di</strong>nal (or profile), normal and planar curvatures for each site through a<br />

finite <strong>di</strong>fference schema. These are defined at the beginning of this chapter and estimated by a finite<br />

<strong>di</strong>fference method. The longitu<strong>di</strong>nal curvature represent the deviation of the gra<strong>di</strong>ent along the the<br />

flow (it is negative if the gra<strong>di</strong>ent increase), the normal and planar curvatures are locally proportional<br />

and measure the convergence/<strong>di</strong>vergence of the flow (the curvature is positive for convergent flow).<br />

Some examples of this kind of geomorphological analysis are <strong>di</strong>splayed in fig 3.11.<br />

Author and date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2004, Andrea Cozzini<br />

& Riccardo Rigon, 1999<br />

Inputs:<br />

1. the file containing the matrix of elevations (obtained with pitfiller);<br />

Output:<br />

1. the file containing the matrix of longitu<strong>di</strong>nal curvatures;<br />

2. the file containing the matrix of normal (or tangent) curvatures;<br />

3. the file containing the matrix of planar curvatures;<br />

JGRASS Command: h.curvatures [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

[–pitformat ] –prof curv –prof curvmapset [–prof curvformat<br />

] –plan curv –plan curvmapset [–plan curvformat<br />

] –tang curv –tang curvmapset [–tang curvformat<br />

] [–usegui]<br />

Notes: The planar and normal (or tangent) curvatures are proportional to each other. To function, the<br />

program uses a matrix in input with a NOVALUE boundary and as a rule it places the curve equal to<br />

zero on the catchment boundary.<br />

References: [50], [46]<br />

Sources: h curvatures.java<br />

33


3. The basic topographic attributes<br />

Figure 3.11: The calculation of the planar curvature, the longitu<strong>di</strong>nal (profile) curvature and the planar curvature of the basin of<br />

the Flanginec river.<br />

34


3.6 DRAINDIR (h.drain<strong>di</strong>r)<br />

3. The basic topographic attributes<br />

Description: It calculates the drainage <strong>di</strong>rections minimizing the deviation from the real flow. The devia-<br />

tion is calculated using a triangular construction and it could be given in degrees (D8 LAD method) or<br />

as trasversal <strong>di</strong>stance (D8 LTD method). The deviation could be cumulated along the path using the<br />

λ parameter, and when it assumes a limit value the flux is re<strong>di</strong>rect toward the real gra<strong>di</strong>ent <strong>di</strong>rection.<br />

If the drainage network is known and marked in a raster matrix, its flow <strong>di</strong>rections can be kept fixed.<br />

Autthor and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Silvano Pisoni, 2005, Erica Gh-<br />

esla, Riccardo Rigon, 2004.<br />

Inputs:<br />

1. the method to use: normal or net fixed<br />

2. the file containing the matrix of elevations (obtained with pitfiller);<br />

3. the file containing the old drainage <strong>di</strong>rection matrix (obtained with flow<strong>di</strong>rections);<br />

4. if we choose to fix the network, the map containing the drainage <strong>di</strong>rections along the network;<br />

5. the λ parameter (a value in the range 0 - 1);<br />

6. the method choosen: LAD (angular deviation) and LTD (trasversal <strong>di</strong>stance);<br />

Output:<br />

1. the file containing the new drainage <strong>di</strong>rections;<br />

2. the file containing the total contributing areas calculated with this drainage <strong>di</strong>rections.<br />

JGRASS Command: h.drain<strong>di</strong>r [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset


3. The basic topographic attributes<br />

Sources: h drain<strong>di</strong>r.java<br />

See Also: PITFILLER, FOLWDIRECTIONS.<br />

Figure 3.12: The new drainage <strong>di</strong>rections of the basin of the Flanginec river.<br />

36


3. The basic topographic attributes<br />

Figure 3.13: The total contributing areas calculated with the new drainage <strong>di</strong>rections. Flanginec river basin.<br />

37


3. The basic topographic attributes<br />

3.7 FLOW DIRECTIONS<br />

(h.flow<strong>di</strong>rections)<br />

Description: it calculates the drainage <strong>di</strong>rections with the method of the maximal steepest descent slope,<br />

choosing it among 8 possible <strong>di</strong>rections, as specified in the opening of this chapter (after [16]).<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon, 1998<br />

Inputs:<br />

1. the file containing the matrix of elevations (obtained with pitfiller);<br />

Output:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections;<br />

JGRASS Command: h.flow<strong>di</strong>rections [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

[–pitformat ] –flow –flowmapset [–flowformat ]<br />

[–usegui]<br />

Notes: The maximal slope <strong>di</strong>rection is chosen among the 8 possible <strong>di</strong>rections and co<strong>di</strong>fied with numbers<br />

ranging from 0 to 8 as specified in the first chapter of this handbook. Such method derives from the<br />

one originarily used by D. Tarboton in his Phd thesis. However the outlets are marked with value 10.<br />

The NODATA is 9 (beware: many other programs assume it)<br />

References: [75],[65]<br />

Sources: h flow<strong>di</strong>rections.java<br />

See Also: Aspect<br />

38


Figure 3.14: The flow<strong>di</strong>rections of the basin of the Flanginec river.<br />

39<br />

3. The basic topographic attributes


3. The basic topographic attributes<br />

3.8 GRADIENTS (h.gra<strong>di</strong>ent)<br />

Description: It estimates the gra<strong>di</strong>ent in each site, defined as the module of the gra<strong>di</strong>ent vector (see fig.<br />

3.18)<br />

Author and date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2005, Andrea Cozzini<br />

& Riccardo Rigon, 2000<br />

Inputs:<br />

1. description file containing the matrix of the elevations (obtained with pitfiller);<br />

Output:<br />

1. description file containing the matrix of the gra<strong>di</strong>ents;<br />

JGRASS command: h.gra<strong>di</strong>ent [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

[–pitformat ] –gra<strong>di</strong>ent –gra<strong>di</strong>entmapset [–gra<strong>di</strong>entputformat<br />

] [–usegui]<br />

Notes: Let’s observe that gra<strong>di</strong>ents, contrarily to slope, does not use the draimage <strong>di</strong>rections defined by<br />

drainage<strong>di</strong>rections. Moreover, gra<strong>di</strong>ents calculates only the module of the gra<strong>di</strong>ent which in reality<br />

is a vectorial quantity, oriented in the <strong>di</strong>rection from the minimal to the maximal potential. As a rule,<br />

the program places on the catchment boundary the gra<strong>di</strong>ent equal to zero.<br />

References: [65], [39]<br />

Sources: h gra<strong>di</strong>ent.java<br />

See also: drainage<strong>di</strong>rections, slope, curvature<br />

40


Figure 3.15: The gra<strong>di</strong>ent calculated on the basin of the river Flanginec.<br />

41<br />

3. The basic topographic attributes


3. The basic topographic attributes<br />

3.9 MULTITCA (h.multitca)<br />

Description: It calculates the contributing areas <strong>di</strong>fferently in convex and concave areas. In the first ones,<br />

the flow of one pixel is sub<strong>di</strong>vided over all the lower adjacent pixels; in the second ones instead only<br />

one drainage <strong>di</strong>rection is used. In our case, the weight used for the partition of the flow is inversely<br />

proportional to the <strong>di</strong>fference in elevation between the pixel and a downstream pixel normalized by<br />

the total drop:<br />

∆zij<br />

Wij = �<br />

j∈{i} ∆zij<br />

(3.35)<br />

where j ∈ {i} means that j spans all the points close to i and lower than it. ∆zij is the drop in<br />

elevation between i and j.<br />

Author and date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2005, Andrea Cozzini<br />

& Riccardo Rigon, 1999<br />

Inputs:<br />

1. file containing the matrix of elevations (obtained with pitfiller);<br />

2. file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

3. file containing the matrix of the aggregated topographic classes 9 (obtained with tc)<br />

Output:<br />

1. file containing the matrix of the contributing areas;<br />

JGRASS Command: h.multitca [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset


Figure 3.16: The map of multitca calculated on the basin of the river Flanginec.<br />

43<br />

3. The basic topographic attributes


3. The basic topographic attributes<br />

3.10 NABLA (h.nabla)<br />

Description: the program can work in two <strong>di</strong>fferent ways:<br />

1. It estimates, for each site, the Laplace operator of the quantity given in input, with a scheme at<br />

the finite <strong>di</strong>fferences:<br />

∇ 2 z = 1 [zi+1,j + zi−1,j − 2zi,j]<br />

2 △y 2<br />

+ 1 [zi,j+1 + zi,j−1 − 2zi,j]<br />

2 △x 2<br />

2. It sub<strong>di</strong>vides the sites in three categories: planar, concave and convex, identifying the categories<br />

through the Laplace operator. The planar sites are those for which ∇ 2 z ≤ ɛ, where ɛ is a prefixed<br />

threshold value. The convention adopted in is the following:<br />

• if |∇ 2 z| ≤ ɛ → 3 (planar sites)<br />

• if |∇ 2 z| > ɛ → 1 (concave sites)<br />

• if |∇ 2 z| < −ɛ → 2 (convex sites)<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, P. Verardo. e R. Rigon, 1998<br />

Inputs:<br />

1. file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the choice between the calculation of the real value or of the classes<br />

3. if we choose the second option, we must specify the threshold to define planarity.<br />

Output:<br />

1. file containing the matrix of the Laplace operator, or the topographic classes (see fig 3.10);<br />

JGRASS Command: h.nabla [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

Notes:<br />

[–pitformat ] –nabla –nablamapset [–nablaformat ]<br />

–mode –th nabla [–usegui]<br />

References: [65], [61]<br />

Sources: h nabla.java<br />

See Also: Curvature<br />

44


Figure 3.17: The map of Laplance operetor calculated on the basin of the river Flanginec.<br />

45<br />

3. The basic topographic attributes


3. The basic topographic attributes<br />

Figure 3.18: The topographic calculated classes on the basin of the river Flanginec.<br />

46


3.11 SLOPE (h.slope)<br />

3. The basic topographic attributes<br />

Description: It estimates the slope in every site by employing the drainage <strong>di</strong>rections. Differently from the<br />

gra<strong>di</strong>ents, slope calculates the drop between each pixel and the adjacent points placed underneath and<br />

it <strong>di</strong>vides the result by the pixel length or by the length of the pixel <strong>di</strong>agonal, accor<strong>di</strong>ng to the cases.<br />

The greatest value is the one chosen as slope.<br />

Author and date: Erica Ghesla 2005, Andrea Cozzini & Riccardo Rigon, 1999<br />

Inputs:<br />

1. files containing the matrix of elevations (obtained with pitfiller);<br />

2. files containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

Output:<br />

1. matrix of the slopes;<br />

JGRASS Command: h.slope [–quiet] [–ver>bose] [–version] [–usage] –pit –pitmapset <br />

[–pitformat ] –flow –flowmapset [–flowformat ]<br />

–slope [–slopemapset ] [–slopeformat ] [–usegui]<br />

Notes: to estimate slopes, this program considers the drainage <strong>di</strong>rections, estimating the slope of every<br />

pixel in the <strong>di</strong>rection of the less high, near pixel (steepestdescent). For many purposes, this slope is<br />

used as an extimation of the gra<strong>di</strong>ent. The pattern shown in Figure 3.18 and 3.21 are in fact very<br />

similar. However, it is apparent that the two definition do not coincide at al.<br />

References: [65], [39], [75]<br />

Sources: h slope.java.<br />

See Also: gra<strong>di</strong>ents<br />

47


3. The basic topographic attributes<br />

Figure 3.19: The slope calculated on the basin of the river Flanginec.<br />

48


3.12 TOTAL CONTRIBUTING AREA<br />

(h.tca)<br />

3. The basic topographic attributes<br />

Description: The upslope catchment (or simply contributing) areas represent the planar projection of the<br />

areas afferent to a point in the basin. Once the drainage <strong>di</strong>rections have been defined, it is possible<br />

to calculate, for each site, the total drainage area afferent to it, in<strong>di</strong>cated as TCA (Total Contributing<br />

Area).<br />

Author and date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2005, Andrea Cozzini<br />

& Riccardo Rigon, 1999<br />

Inputs:<br />

1. the file containing the matrix of drainage <strong>di</strong>rections (obtained with markoutlets);<br />

Output:<br />

1. the file containing the matrix of the real areas;<br />

JGRASS Command: h.tca [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowformat ] –tca –tcamapset [–tcaformat ] [–<br />

usegui]<br />

References: [41], [65], [39], [75]<br />

Notes:<br />

Sources: h tca.java<br />

See also: A/b section 3.3, TCA3D section 3.12, MULTITCA section 3.9.<br />

49


3. The basic topographic attributes<br />

Figure 3.20: The total contributing area calculated on the basin of the river Flanginec.<br />

50


3.13 TOTAL CONTRIBUTING AREA 3D<br />

(h.tca3D)<br />

3. The basic topographic attributes<br />

Description: It estimates the real draining area and not only its projection on the plane as the TCA do.<br />

Author and date: Erica Ghesla, Riccardo Rigon, 2005.<br />

Inputs:<br />

1. the file containing the matrix of pitless elevations (obtained with pitfiller);<br />

Output:<br />

1. the file containing the matrix of the real areas;<br />

JGRASS Command: h.tca3D [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

[–pitformat ] –flow –flowmapset [–flowformat ]<br />

–tca3D –tca3Dmapset [–tca3Dformat ] [–usegui]<br />

Notes: The way to calculate the 3D area is to approximate with triangles the DEM surface and then sum-<br />

ming the triangles area going downstream from sources to outlet.<br />

References: This <strong>manual</strong><br />

Sources: h tca3D.java<br />

See also: TCA section 3.12.<br />

51


3. The basic topographic attributes<br />

Figure 3.21: The total contributing area 3D calculated on the basin of the river Flanginec.<br />

52


4 Basin related analyses<br />

This chapter deals with the delineation of a basin from a DEM and the extraction of some in<strong>di</strong>cators<br />

of the basin form or “shape parameters”. To some extent the exiting literature on the subject seems out of<br />

date since it is clear that the need for ”in<strong>di</strong>cators” reveals the inability to do real statistics on the basins.<br />

Among the literature[5] is certainly a first rea<strong>di</strong>ng which emphasizes that the search for such in<strong>di</strong>cators is<br />

also a search for the signatures of basin evolution and history. Very seldom the basins shape has been treated<br />

in a separate manner from the channel networks, since the network “is the basins” (up to the point where<br />

hillslope are) as the recent fractal theories of the river geomorphology state [65]. From DEM perspective the<br />

river basin is obtained once the drainage <strong>di</strong>rections are traced and the <strong>di</strong>vides between two basins are those<br />

points from which drainage <strong>di</strong>rections <strong>di</strong>verge. As [81] points out drainage and <strong>di</strong>vides are interlocked.<br />

DEMs introduce some new problems but also let calculate shape in<strong>di</strong>cators for any point inside a basin and<br />

eventually to make statistics out of it.<br />

A first set of ’new’ terrain measures includes mean elevation, [25], [78]. ’New’ parameters, however,<br />

rarely are; many describe the same basic attribute of surface form and thus are redundant [57] and we keep<br />

the simplest ones [52]. Fractal interpretation of surfaces added new fuel to some measurements even if<br />

more attention has been given to the planar features of the basins (probably an inheritance of the “map,<br />

pencil and sweat” times of geomorphometry) than to the more complicated problem of characterizing relief,<br />

or Z-domain, attributes of continuous topography [35]. The property investigated in such fractal analysis is<br />

the “self-affinity” whose meaning is <strong>di</strong>scussed in [20] and is connected to the so-called Hack’s law which<br />

however involves the definition of the channel network inside the basin.<br />

4.1 DIAMETERS (h.<strong>di</strong>ameters)<br />

Description: It calculates the <strong>di</strong>ameter of the basin subtended to a point. This is the <strong>di</strong>stance between the<br />

basin outlet and the point on the boundary farest from it. The calculus is repeated for each significant<br />

point contained in a DEM. There could be alternative definitions of <strong>di</strong>ameter (as for instance the


4. Basin related analyses<br />

<strong>di</strong>stance between any two points of a basin), here not considered.<br />

Author and date: Erica Ghesla, 2005, Riccardo Rigon, 1998<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. it is necessary to choose if in the calculus only the ’source’ points, or all points (as possible<br />

Output:<br />

points belonging to the sub-basins boundaries) have to be considered. This if effected by typing,<br />

when requested, 1 or 0.<br />

1. the file containing the matrix of the <strong>di</strong>ameters;<br />

JGRASS Command: h.<strong>di</strong>ameters [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowmformat ] –<strong>di</strong>ameters –<strong>di</strong>ametersmapset [–<br />

<strong>di</strong>ametersformat ] –mode [–usegui]<br />

Notes: Since the <strong>di</strong>ameter is calculated for the basin subtended to every point, the computation is quite<br />

slow.<br />

References: [20]<br />

Sources: h <strong>di</strong>ameters.java<br />

See Also: Hacklength, Hacklength3D, TopologicalDiameters,<br />

54


Figure 4.1: Diameters calculated on the basin of the river Flanginec.<br />

55<br />

4. Basin related analyses


4. Basin related analyses<br />

4.2 DIST EUCLIDEA (h.<strong>di</strong>st euclidea)<br />

Description: It calculates the euclidean <strong>di</strong>stance of each pixel from the outlet of the bigger basin which<br />

contains it.<br />

Author and date: Erica Ghesla, 2005, Andrea Cozzini & Riccardo Rigon, 2000<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

Output:<br />

1. the file containing the matrix of the <strong>di</strong>stances;<br />

item [JGRASS Command:] h.<strong>di</strong>st euclidea [–quiet] [–verbose] [–version] [–usage] –flow –<br />

flowmapset [–flowmformat ] –<strong>di</strong>st euclidea –<strong>di</strong>st euclideamapset<br />

[–<strong>di</strong>st euclideaformat ] [–usegui]<br />

Notes: The program is a trivial application of the Pythagoras theorem formed by the plane Cartesian axes<br />

with the line joining the pixel in question and the outlet.<br />

References: [62]<br />

Sources: h <strong>di</strong>st euclidea.java<br />

56


Figure 4.2: The euclidean <strong>di</strong>stance calculated on the basin of the river Flanginec.<br />

57<br />

4. Basin related analyses


4. Basin related analyses<br />

4.3 PRINCIPAL AXES (h.principal axes)<br />

Description: principal axes finds the main moments of inertia of each subnet of a channel net. The mo-<br />

ments of inertia are defined as the moments of inertia with respect to the axes of a basin, considered<br />

as a bi<strong>di</strong>mensional body with uniform mass. The moments are first calculated with respect to the<br />

coor<strong>di</strong>nated axes. Then, the maximal ad minimal eigenvalues representing the moments of inertia<br />

with respect to a particular couple of axes (the main axes exactly) are calculated. It is known that the<br />

moment of inertia with respect to an arbitrary couple of axes is a symmetrical tensor which possesses<br />

then (D 2 + D)/2 independent components, where (D = 2 in this case).<br />

Author and date: Erica Ghesla, 2005, Riccardo Rigon, 1998<br />

Inputs:<br />

1. the map of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the map of the contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

Output:<br />

1. the map containing the greater eigenvalue;<br />

2. the map containing the lesser eigenvalue.<br />

JGRASS command: h.principal axes [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

[–flowmformat ] –tca –tcamapset [–tcaformat<br />

] –principal axes1<br />

–principal axesmapset1 [–principal<br />

axesformat1 ] –principal axes2 –principal axesmapset2<br />

[–principal axesformat2<br />

] [–usegui]<br />

Notes: The application contains three main routines: baricenter, moment of inertia and principal axes,<br />

which are documented in the following codex.<br />

References: any text of elementary classic mechanics or [52]<br />

Sources: h principal axes.java<br />

58


4.4 MEAN DROP (h.mean drop)<br />

4. Basin related analyses<br />

Description: It calculates the mean value of a quantity defined by the input matrix (for example of eleva-<br />

tions) calculated on the basin upriver with respect to every point, decreased of the value of the quantity<br />

measured in the point itself (for instance the elevation of the point: from which the name). If B is the<br />

quantity examined, then: L(j) = ( �<br />

i Bi)j/Aj − Bj.<br />

Author e date: Erica Ghesla, 2005, Marco Pegoretti e Riccardo Rigon, luglio 1999<br />

Inputs:<br />

1. the file of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file of the contributing areas (which, being the contributing areas measured in pixels, is<br />

necessary to obtain the averaged value of the quantity);<br />

3. the file containing the quantity of which estimating the mean value<br />

Output:<br />

1. the file containing the mean values of the quantity for each point within the basin ananyzed.<br />

JGRASS Command: h.mean drop [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

Note:<br />

[–flowmformat ] –tca –tcamapset [–tcaformat<br />

] –summ <br />

–summmapset [–summformat ] –mean drop –mean dropmapset<br />

[–mean dropformat ] [–usegui]<br />

References: This <strong>manual</strong><br />

Sources: h mean drop.java<br />

59


4. Basin related analyses<br />

Figure 4.3: The mean drop calculated on the basin of the river Flanginec.<br />

60


5 Network related measures<br />

The work on ridges and water courses dates back at least to the eighteenth century and almost from the<br />

early beginning was linked to theory of evolution of river networks. From this point of view a very recent<br />

contribution is given by [65]. A necessary introductory rea<strong>di</strong>ng for the subject in study here is also [1]. [30]<br />

collects a series of fundamental paper on the subject which includes [23], [45],[5];[53]; [36]; [37]; [38] and<br />

other fundamental papers some of which will be cited later on and in [57]. Among the recent papers [20];<br />

[4]; [68];[69] and references therein brings some new stuff and knowledge. All the above papers refers to<br />

the branching structure on river basin (ultimately found to be a fractal) and to its classification or ordering.<br />

However, once the network is delineated (or “extracted” as it is usually said) network informations can be<br />

used to several goals. One of the main is to infer the hydrological response, either looking at the statistical<br />

structure of the networks (e. g. - [66]; [21] ) or by the actual <strong>di</strong>stribution of pathways called width function,<br />

e.g. [65].<br />

Figure 5.1: The network of the river Flanginec.


5. Network related measures<br />

A river network is a (topologically) 1-D tree-like structure. Actually it is a oriented trifurcated tree since,<br />

as shown in figure, the channels merge (usually) two by two in each node (or junction) and the flow through<br />

the tree is given by the drainage <strong>di</strong>rections (upstream to downstream). The outlet is the root of the tree. The<br />

leaves of the tree are called sources. For what regards all the analysis in this chapter the channel are true 1-D<br />

elements with no structure inside. In the past, based on the topological classification of the river networks,<br />

a lot of science has been made [1], [65].<br />

Strahler [53] introduced the following classification of river networks tree: i) sources are of order 1; ii)<br />

when two stream of order 1 merge they form a stream of order 2; iii) in general when two streams, of order<br />

i and j merge they continue into a stream of order which is max(i, j) if i �= j, otherwise they form a new<br />

stream of order i + 1 = j + 1. Thus a stream is composed usually by many links.<br />

A <strong>di</strong>fferent labeling scheme for the network was introduced by Shreve [36] who numbered the links<br />

accor<strong>di</strong>ng to the number of sources upstream. The numbers of each link was called the magnitude of the<br />

link. The magnitude was used as a proxy for the contributing areas to each link.<br />

Strahler ordering was used to express the so called <strong>Horton</strong>’s laws: :<br />

The bifurcation law<br />

N(ω, Ω)<br />

N(ω + 1, Ω) ≈ RB (ω = 1, 2, .., Ω) (5.1)<br />

where RB is said bifurcation ratio, Nω is the number of stream of order ω in a given river network, Ω is the<br />

order of the network, i.e. the maximum Strahler’s order in the network. The length’s law<br />

L(ω + 1, Ω)<br />

L(ω, Ω) ≈ RL (ω = 1, 2, ..., Ω) (5.2)<br />

where RL is said length ratio, Lω is the average lenght of stream of order ω in a given river network. and<br />

the areas law (actually due to Schumm)<br />

A(ω + 1, Ω)<br />

A(ω, Ω) ≈ RA (ω = 1, 2, ...Ω) (5.3)<br />

where RA is said area ratio, Aω is the average total area at the outlet of streams of order ω in a given river<br />

network.<br />

Eventually the <strong>Horton</strong>’s law where found to be the signature of the fractality of the river network and<br />

related to power laws [65].<br />

62


5.1 The Hack’s length and the Width function<br />

5. Network related measures<br />

The Hack’s length is the <strong>di</strong>stance from any point in the basin to the <strong>di</strong>vides, measured along the drainage<br />

<strong>di</strong>rections. Starting from a point, P an going uphill, at any bifurcation the stream with larger area is followed.<br />

If two merging stream have the same contributing area, the longest is followed. Otherwise one of the<br />

stream is chosen at random. The Hack length is the geomorphic signature of what the hydrologists call the<br />

concentration time of the basin closed at P . As follows from [62], the <strong>di</strong>stribution of Hack’s length inside a<br />

large enough basin is approximated by a power law:<br />

P [L > l] = l −γ g(l/LT ) (5.4)<br />

where g is a scaling function, l the Hack’s length, LT a scale length. The exponent γ, is usually around -0.8<br />

and is linked to other power law <strong>di</strong>stributions [4].<br />

If instead of the Hack’s length is considered the <strong>di</strong>stance from any point, P , in a basin to the outlet (D2O)<br />

of the basin (also measured along the drainage <strong>di</strong>rections), one can derive the so called width function [33].<br />

This is the probability density function of the above quantity and it is an in<strong>di</strong>cator of “the width” of the<br />

basin at a certain <strong>di</strong>stance from the outlet. As shown in [11] and reference therein from this function can be<br />

obtained a geomorphic instantaneous unit hydrograph. The model Peakflow, also implemented in JGRASS,<br />

uses it.<br />

63


5. Network related measures<br />

5.2 D2O (h.D2O)<br />

Figure 5.2: Hack’s <strong>di</strong>stances from the devides referred to Flanginec basin.<br />

Description: D2O (Distance to outlet) calculates the projection on the plane of the <strong>di</strong>stance of each pixel<br />

from the outlet, measured along the drainage <strong>di</strong>rections. By aggregating the matrix so obtained, we<br />

get the so called width function. The program can work in two <strong>di</strong>fferent ways: it can calculate the<br />

<strong>di</strong>stance from the outlet either in pixel number (0:topological <strong>di</strong>stance mode), or in meters (1:simple<br />

<strong>di</strong>stance mode).<br />

Author and date: Andrea Antonello, Andrea Cozzini, Erica Ghesla, 2004, R. Rigon, 1998<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

Output:<br />

1. the file containing the matrix of the <strong>di</strong>stances;<br />

JGRASS Command: h.D2O [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowformat ] –<strong>di</strong>st2outlet<br />

–<strong>di</strong>st2outletmapset [–<strong>di</strong>st2outletformat<br />

] –mode [–usegui]<br />

64


Figure 5.3: The topological <strong>di</strong>stance to outlet calculated on the basin of the Flanginec.<br />

5. Network related measures<br />

Notes: The <strong>di</strong>stance is estimated by following the path joining each pixel with the outlet following the<br />

drainage <strong>di</strong>rections. In the topological mode, the <strong>di</strong>stance is measured in pixel number and without<br />

<strong>di</strong>stinguishing between <strong>di</strong>rections parallel to the coor<strong>di</strong>nates and <strong>di</strong>agonal <strong>di</strong>rections. In the simple<br />

mode, the <strong>di</strong>stance is obtained in meters and oblique <strong>di</strong>rections (D8 flow is assumed) are calculated<br />

applying the Pithagorean theorem.<br />

References: [11] and references therein, [34]<br />

Sources: h D2O.java<br />

See Also: drainage<strong>di</strong>rections, d2o3D<br />

65


5. Network related measures<br />

5.3 D2O3D (h.D2O3D)<br />

Description: It calculates the <strong>di</strong>stance of every pixel within the basin, considering also the vertical coor<strong>di</strong>-<br />

nate (<strong>di</strong>fferently from <strong>di</strong>stance2outlet which calculates its projection only)<br />

Author and date: Erica Ghesla, 2005, R. Rigon, 1998<br />

Inputs:<br />

1. the file of elevations (obtained with pitfiller);<br />

2. the file of the draining <strong>di</strong>rections (obtained with markoutlets);<br />

Output:<br />

1. the file containing the <strong>di</strong>stances.<br />

JGRASS Command: h.D2O3D [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

Note:<br />

[–pitformat ] –flow –flowmapset [–flowmformat ]<br />

–<strong>di</strong>st2outlet <br />

–<strong>di</strong>st2outletmapset [–<strong>di</strong>st2outletformat<br />

] [–usegui]<br />

References: This <strong>manual</strong><br />

Sources: h D2O3D.java<br />

See Also: drainage<strong>di</strong>rections, D2O<br />

66


Figure 5.4: The real 3-<strong>di</strong>mensional <strong>di</strong>stance to outlet calculated on the basin of the Flanginec River.<br />

67<br />

5. Network related measures


5. Network related measures<br />

5.4 DD (h.DD)<br />

Description: It estimates the drainage density function for the basin upstream of each pixel. Drainage<br />

density is defined as the total network length (i.e. the sum of all the stream lengths) <strong>di</strong>vided by the<br />

total length of the up-slope catchment area: Z/A. It has the the <strong>di</strong>mension of the inverse of a length<br />

and such a length was shown by <strong>Horton</strong> to be an estimator of the average hillslope length.<br />

Author and date: Erica Ghesla, 2005, Andrea Cozzini & Riccardo Rigon, 2001<br />

Inputs:<br />

1. the file containing the matrix of the hack <strong>di</strong>stances (obtained with hacklength);<br />

2. the file containign the channel network (obtained with extractnetwork);<br />

3. the file containing the matrix of the upriver contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

Output:<br />

1. the file containing the matrix of the total <strong>di</strong>stances of each point of the net from the outlet;<br />

2. the file containing the matrix of the drainage density;<br />

JGRASS Command: h.DD [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowmformat ] –tca –tcamapset [–tcaformat ] –<br />

net –netmapset [–netformat ] –dd –ddmapset <br />

[–ddformat ] [–usegui]<br />

Notes: The <strong>di</strong>stance of each pixel from the outlet is a simple application of the routine sum downstream.c<br />

at the Hack <strong>di</strong>stances estimated for each pixel, so the sum of this quantity effected only for the pixels<br />

belonging to the net makes it possible to estimate the net length in each point.<br />

References: [65]<br />

Sources: h DD.java<br />

See Also: tca, tca3D,<br />

68


Figure 5.5: The drainage density calculated on the basin of the Flanginec.<br />

69<br />

5. Network related measures


5. Network related measures<br />

5.5 EXTRACT NETWORK<br />

(h.extractnetwork)<br />

Description: It extracts the channel network from the drainage <strong>di</strong>rections in five possible ways:<br />

1. by using a threshold value on the contributing areas (then only the pixels with contributing area<br />

greater than thethreshold are the channel heads) → mode 0;<br />

2. by using a threshold value of the parameter: α∇ n z √ A, equivalent to a threshold value of the<br />

stress tangential to the bottom → mode 1;<br />

3. by using a threshold value on the stress tangential to the bottom → mode 2;<br />

In<strong>di</strong>viduated the beginning of the channel incision, the points upriver are considered as canalized.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon, 1998<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the matrix of contributing areas (calculated with drain<strong>di</strong>r, tca or multitca);<br />

3. the methodology for extracting the net;<br />

Output:<br />

• if mode 0:<br />

(a) other files are not requested<br />

• if mode 1:<br />

(a) the file containing the matrix of the slopes (calculated with slope);<br />

• if mode 2:<br />

(a) the file containing the matrix with the classes aggregated by GC;<br />

1. the file containing the matrix which in<strong>di</strong>viduates the channel network;<br />

JGRASS Command: h.extractnetwork [–quiet] [–verbose] [–version] [–usage] –prof curv –<br />

prof curvmapset [–prof curvformat ] –tang curv <br />

–tang curvmapset [–tang curvformat ]–cp3map <br />

–cp3mapmapset [–cp3mapformat


Figure 5.6: The network of the river Flanginec extracted with a treshold on the TCA.<br />

Notes: the matrix with the channel net in<strong>di</strong>viduates two classes of elements on the DEM:<br />

• non-canalized sites (0);<br />

• channel sites (2);<br />

References: [32],[48] [17], [65],[49] [60], [47], [74]<br />

See Also: TC, GC, FLOWDIRECTIONS, DRAINDIR, GRADIENT, SLOPE.<br />

Sources: h extractnetwork.java<br />

71<br />

5. Network related measures


5. Network related measures<br />

5.6 HACKLENGTHS (h.hacklength)<br />

Description: It calculates the Hack quantities, namely, assigned a point in a basin, the projection on the<br />

plane of the <strong>di</strong>stance from the watershed measured along the network (until it exists) and then, pro-<br />

cee<strong>di</strong>ng again from valley upriver, along the maximal slope lines. For each network confluence, the<br />

<strong>di</strong>rection of the tributary with maximal contributing area is chosen. If the tributaries have the same<br />

area, one of the two <strong>di</strong>rections is chosen at random.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon 1997<br />

Inputs:<br />

1. the file containing the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

Output:<br />

1. the file containing the matrix of the Hack <strong>di</strong>stances<br />

JGRASS Command: h.hacklength [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

Notes:<br />

[–flowformat ] –tca –tcamapset [–tcaformat ]<br />

–hack –outmapset [–outputformat ] [–usegui]<br />

References: [22] [20] [65]<br />

Sources: h hacklength.java<br />

See Also: hacklength3D, hackstream<br />

72


Figure 5.7: Hacklengths calculated on the river Flanginec.<br />

73<br />

5. Network related measures


5. Network related measures<br />

5.7 HACKLENGTH3D (h.hacklengths3D)<br />

Description: It calculates the Hack’s lengths but using also the elevations to give the three <strong>di</strong>mensional<br />

length.<br />

Author and date: Erica Ghesla, 2005, Pegoretti e Riccardo Rigon, 1998<br />

Inputs:<br />

1. the file containing the elevations of the DEM (obtained with pitfiller);<br />

2. the file containing the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

3. the file containing the contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

Output:<br />

1. matrix of the Hack <strong>di</strong>stances<br />

JGRASS Command: h.hacklengths3D [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset <br />

[–pitformat ] –flow –flowmapset [–flowformat ]<br />

–tca –tcamapset [–tcaformat ] –hackl3D –hackl3Dmapset<br />

[–hackl3Dformat ] [–usegui]<br />

Notes: Differently from Hacklength, the <strong>di</strong>stance is calculated also by calculating the contribution of ele-<br />

vation.<br />

References: See Hacklength<br />

See Also: HackLength, Hackstream<br />

Sources: h hacklengths3D.java<br />

74


Figure 5.8: Hacklengths 3-<strong>di</strong>mentional calculated on the river Flanginec.<br />

75<br />

5. Network related measures


5. Network related measures<br />

5.8 HACKSTREAM (h.hackstream)<br />

Description: HackStream arranges a channel network starting from the identification of the branch accord-<br />

ing to Hack. The main stream is of order 1 and its tributaries of order 2 and so on, the sub-tributaries<br />

are of order 3 and so on.<br />

Author e date: Erica Ghesla, 2005, Riccardo Rigon, 1999<br />

Inputs:<br />

1. the file containing the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

3. the file containing the Hack lengths (obtained with hacklength);<br />

4. the file containing the channel network (obtained with extractnetwork);<br />

Output:<br />

1. the file of the order accor<strong>di</strong>ng the Hack lengths.<br />

JGRASS Command: h.hackstream [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

[–flowformat ] –tca –tcamapset [–tcaformat ]<br />

–hacklength –hacklengthmapset [–hacklengthformat<br />

] –net –netmapset [–netformat<br />

] –hackstream –hackstreamapset [–hackstreamformat<br />

] [–usegui]<br />

Note: Such order correponds (one to one) to the old <strong>Horton</strong>’s network numeration. It is necessary that the<br />

output pixels present a drainage <strong>di</strong>rection value equal to 10. If there is not such identification of the<br />

mouth points, the program does not function correctly.<br />

References: This <strong>manual</strong>, [22] [20] [65]<br />

Sourcesi: h hackstream.java<br />

See Also: HackLength, Hacklength3D<br />

76


Figure 5.9: Map of HackStream calculated on the river Flanginec.<br />

77<br />

5. Network related measures


5. Network related measures<br />

5.9 LANGBEIN (h.langbein)<br />

Description: It calculates the sinuosity (so called by [42]) of a river network, if the second input is the<br />

matrix of the <strong>di</strong>stances from the outlet (for example obtained by <strong>di</strong>stance2outlet). In each case it<br />

calculates, for each quantity B, ( �<br />

j (Bj − Ai Bi)) where the index j varies upriver with respect to i.<br />

The sinuosity had been previously introduced by [40].<br />

Author and data: Riccardo Rigon, Agosto 1998.<br />

Inputs:<br />

1. the file of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file of the contributing areas (obtained with drain<strong>di</strong>r or tca);<br />

3. the file of the <strong>di</strong>stances from the outlet (or every other quantity);<br />

Output:<br />

1. the file of sinuosity<br />

GRASS Command: r.langbein.ft drainage<strong>di</strong>rectins=name tca=name output=<br />

name<br />

Notes: If, instead of the <strong>di</strong>stances from the outlet any else unit is used, the resulting matrix can contain<br />

negative values. In the last case, the value NOVALUE (set equal to 1) could be non-significant.<br />

References: [40] [42]<br />

Sources: langbein.java<br />

See Also: sumdownstream<br />

78


5.10 MAGNITUDE (h.magnitudo)<br />

5. Network related measures<br />

Description: It calculates the magnitude of a basin, defined as the number of sources upriver with respect<br />

to every point. If the river net is a trifurcated tree (a node in which three channels enter and one exits),<br />

then between number of springs and channels there exists a bijective correspondence hc = 2ns − 1<br />

where hc is the number of channels and ns the number of sources; the magnitude is then also an<br />

in<strong>di</strong>cator of the contributing area.<br />

Author e date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2005,<br />

R. Rigon, 1998<br />

Inputs:<br />

1. matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

Output:<br />

1. a file containing the matrix of the basin magnitude;<br />

JGRASS Command: h.magnitudo [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

[–flowmformat ] –magnitudo –magnitudomapset


5. Network related measures<br />

Figure 5.10: The magnitudo calculated on the Flanginec river.<br />

80


5.11 NET DIFF(h.net<strong>di</strong>f)<br />

5. Network related measures<br />

Description: It calculates the <strong>di</strong>fference between the value of a quantity in one point and the value of the<br />

same quantity in another point across a basin. The points in which calculating the <strong>di</strong>fference are<br />

in<strong>di</strong>viduated by an opportune matrix. Typically this matrix could contain the values of the Strahler<br />

numbers of a net, i.e. the network pixels are labeled by the stream number and the same stream<br />

contains a group of subsequent pixel. The points chosen for the calculation of the <strong>di</strong>fference are<br />

the first and the last of any stream, i.e. those in which the numeration changes. If the matrix of the<br />

quantity to calculate is that of elevations, then, again in the case shown, net<strong>di</strong>ff calculates the elevation<br />

<strong>di</strong>fference along a Strahler branch. If instead of the file containing the Strahler numeration the matrix<br />

of the magnitude is used, the variation of a quantity in a link is measured.<br />

Author and date: Erica Ghesla 2005, Riccardo Rigon, Marco Pegoretti, Luglio 1999.<br />

Inputs:<br />

1. the file of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing thand date on which estimating the <strong>di</strong>fference (in the example above the<br />

matrix of the Strahler numeration);<br />

3. the file containing the quantity of which calculating the <strong>di</strong>fference (in the example above the<br />

Output:<br />

matrix containing the elevations).<br />

1. matrix of the <strong>di</strong>fferences<br />

JGRASS Command: h.net<strong>di</strong>f [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

Notes:<br />

[–flowformat ] –stream –streammapset [–streamformat<br />

] –map<strong>di</strong>ff –map<strong>di</strong>ffmapset [–map<strong>di</strong>ffformat ] –<strong>di</strong>ff –<strong>di</strong>ffmapset [–<strong>di</strong>ffformat ] [–usegui]<br />

References: [30] [65]<br />

Sources: h net<strong>di</strong>f.java<br />

See Also: MAINDROP, SEOL<br />

81


5. Network related measures<br />

Figure 5.11: The net<strong>di</strong>f calculated on the Flanginec river using the map of elenations.<br />

82


5.12 NETNUMBERING (h.netnumbering)<br />

5. Network related measures<br />

Description: It assign numbers to the network’s links and can be used by hillslope2channelattribute to<br />

label the hillslope flowing into the link with the same number.<br />

Author and date: Andrea Cozzini, Erica Ghesla, Riccardo Rigon, 2004<br />

Inputs:<br />

1. the file containing the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the channel network (obtained with extractnetwork);<br />

Output:<br />

1. the file containing the net with the streams numerated;<br />

2. the file containing the sub-basins.<br />

JGRASS Command: h.D2O [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowformat ] –<strong>di</strong>st2outlet<br />

–<strong>di</strong>st2outletmapset [–<strong>di</strong>st2outletformat<br />

] –mode [–usegui]<br />

Notes: The algorithm start from the channel heads which are numbered first. Then, starting again from each<br />

source, the drainage <strong>di</strong>rection are followed till a junction is found. If the link downhill the junction<br />

was already numbered, a new source is chosen. Otherwise the network is scanned downstream ad a<br />

new number is attributed to the link’s pixels. Was extensively used for the calculations in [11]<br />

References: This <strong>manual</strong><br />

Sources: h netnumbering.java<br />

See Also: SPLITSUBBASIN<br />

83


5. Network related measures<br />

Figure 5.12: The subbasins calculated on the Flanginec river basin.<br />

84


5.13 RESCALED DISTANCE<br />

(h.rescaled<strong>di</strong>stance)<br />

5. Network related measures<br />

Description: It calculates the rescaled <strong>di</strong>stance of each pixel from the outlet. Such <strong>di</strong>stance is so defined:<br />

[x ′ = xc + rxh] where: xc is the <strong>di</strong>stance along the channels, r = c<br />

ch<br />

the ratio between the speed in<br />

the channel state, c and the speed in the hillslopes, ch, and xh the <strong>di</strong>stance along the hillslopes.<br />

Author and Date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, 2005, Andrea Cozzini, Silvano<br />

Pisoni, Riccardo Rigon, 2001<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with drainage<strong>di</strong>rections);<br />

2. the file containing the net (obtained with extract network);<br />

Output:<br />

1. the file containing the matrix of the rescaled <strong>di</strong>stances;<br />

JGRASS Command: h.rescaled<strong>di</strong>stance [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

[–flowmformat ] –net –netmapset [–netformat<br />

]<br />

–rescale<strong>di</strong>stance –resc<strong>di</strong>stmapset –resc<strong>di</strong>stformat <br />

–r [–usegui]<br />

Notes: The program requests also the ratio r between speed in the channel and speed in hillslopes. The<br />

speed in channels is always greater than that in hillslopes.<br />

References: [64], [11]<br />

Sources: h rescaled<strong>di</strong>stance.java<br />

See Also: D2O<br />

85


5. Network related measures<br />

Figure 5.13: The rescaled <strong>di</strong>stance on the river Flanginec basin.<br />

86


5.14 RESCALED DISTANCE 3D<br />

(h.rescaled<strong>di</strong>stance3D)<br />

5. Network related measures<br />

Description: Rescaled <strong>di</strong>stance 3D calculates the <strong>di</strong>stance of every pixel within the basin, considering also<br />

the vertical coor<strong>di</strong>nate (<strong>di</strong>fferently from recaled<strong>di</strong>stance which calculates its projection only).<br />

Author and Date: Erica Ghesla, Riccardo Rigon, 2005<br />

Inputs:<br />

1. the file containing the matrix of the elevations;<br />

2. the file containing the matrix of the drainage <strong>di</strong>rections;<br />

3. the file containing the channel network;<br />

Output:<br />

1. the file containing the matrix of the rescaled <strong>di</strong>stances;<br />

JGRASS Command: h.rescaled<strong>di</strong>stance3D [–quiet] [–verbose] [–version] [–usage] –pit –pitmapset<br />

[–pitformat ] –flow –flowmapset [–flowmformat<br />

] –net –netmapset [–netformat ]<br />

–rescale<strong>di</strong>stance3D –resc<strong>di</strong>st3Dmapset<br />

–resc<strong>di</strong>st3Dformat –r [–usegui]<br />

Notes: The program requests also the ratio r between speed in the channel and speed in hillslopes. The<br />

speed in channels is always greater than that in hillslopes.<br />

References: [64], [11] and this <strong>manual</strong><br />

Sources: h rescaled<strong>di</strong>stance3D.java<br />

87


5. Network related measures<br />

Figure 5.14: The rescaled <strong>di</strong>stance 3D on the river Flanginec basin.<br />

88


5.15 STRAHLER (h.strahler)<br />

Description: it makes it possible to calculate the Strahler order in a basin.<br />

1. calculate the Strahler order in whole the basin mode 0;<br />

2. calculate the Strahler order only on the network mode 1;<br />

Author and date: Erica Ghesla, 2005, M. Pegoretti & R. Rigon, 1999<br />

Inputs:<br />

1. the file of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the channel network (obtained with extractnetwork);<br />

Output:<br />

1. the file containing the network with the branches numerated accor<strong>di</strong>ng to Strahler .<br />

5. Network related measures<br />

JGRASS Command: h.strahler [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowformat ] [–net ] [–netmapset ] [–netformat ] –<br />

mode


5. Network related measures<br />

Figure 5.15: Strahler order in the basin of the river Flanginec.<br />

90


5.16 SEOL (h.seol)<br />

5. Network related measures<br />

Description: Assuming to have ordered the network accor<strong>di</strong>ng to Strahler, SEOL selects the end of a<br />

Strahler branch (if the matrix of the Strahler numeration is given in input). Then it extracts the value<br />

of a second matrix given in input only in the points chosen (for example the contributing areas in the<br />

final pixel of the Strahler branches). It works for any other numbering scheme of the network (i.e,<br />

magnitudo, Hackstream, Netnumbering) It is necessary to extract statistics for a subset of the basin<br />

points.<br />

Author and date: Erica Ghesla, 2005, Riccardo Rigon, Marco Pegoretti Luglio 1999<br />

Inputs:<br />

1. the file of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the quantity to examine (e.g. the contributing areas);<br />

3. the file containing the channel network (obtained with extractnetwork);<br />

4. the output mode: compressed (1) or normal (0). In the first case we create a file containing the<br />

Output:<br />

coor<strong>di</strong>nates of the points selected and the value of the quantity; in the second case we reproduce<br />

the file with the DEM and the values of the quantity analized, substituted by NOVALUE in the<br />

non-selected points.<br />

1. the file containing the values of the quantity analized in the points selected, accor<strong>di</strong>ng to the<br />

modes already described.<br />

JGRASS Command: h.seol [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

Note:<br />

[–flowmformat ] –quantity –quantitymapset [–quantityformat<br />

] –net –netmapset [–netformat ] –seol <br />

–seolmapset [–seolformat ] [–usegui]<br />

References: [71]<br />

Sources: h seol.java<br />

See Also: net<strong>di</strong>f<br />

91


6 Hillslope analisys<br />

6.1 Definitions and main properties<br />

One main practical <strong>di</strong>fference among hydrologists and geomorphologists is the attitude to look at river<br />

basins from a <strong>di</strong>fferent scale perspective (this is naturally an oversimplification of the facts with some but<br />

remarkable exceptions since <strong>Horton</strong>’s work): geomorphologists (and especially field geomorphologists)<br />

observe and walks on hillslopes, while hydrologists are looking at the river networks as a whole (especially<br />

but not only for rainfall-runoff modelling). The first look at the network as a process of “up-scaling” the local<br />

properties, the latters look at the hillslope as a constituent of a large interconnected system (the knowledge<br />

of which is the ultimate goal). A nice presentation of the geomorphologists point of view is in the recent<br />

[10] while the other view can be seen in the book by [65]. The two cited contributions show indeed an effort<br />

to link the two views with some interesting results. A special kind of geomorphologists are the “fluvial<br />

geomorphologists”: they study the inside of a river channel and to some respect the never en<strong>di</strong>ng movement<br />

of channel links, which is not the subject of this <strong>manual</strong>. A booklet showing a classical geomorphologist’s<br />

approach to hillslope is [3].<br />

A useful concept recently introduced is that of geomorphic process domains (GPD) [48]. They are<br />

defined as topographic partitions within which one or a collection of earth surface processes prevails for<br />

the detachment and/or transport of mass. Plots of the logarithms of local slope gra<strong>di</strong>ent vs. contributing<br />

drainage area have been used to delineate process domains (Figure. 6.1). Slope and area represent first<br />

order approximations to the physical con<strong>di</strong>tions at which processes are active and can be rea<strong>di</strong>ly extracted<br />

from DEMs. Slope is in<strong>di</strong>cative of mass wasting initiation and deposition thresholds as well as of channel-<br />

reach morphology. Area is a proxy for <strong>di</strong>scharge and se<strong>di</strong>ment supply.<br />

As shown by Brar<strong>di</strong>noni and Hassan (in press), specifically, process-specific topographic signatures<br />

rarely match the domains of currently active geomorphic process, and <strong>di</strong>rect scale linkages are evident<br />

at all landscape levels. For instance, in their work in British Columbia, relict glacial macro-forms (e.g.,<br />

cirques, hanging valleys, and troughs) by imposing local channel gra<strong>di</strong>ent and degree of colluvial-alluvial<br />

coupling, affect the spatial <strong>di</strong>stribution of process domains, which in turn control channel-reach morphology<br />

and hydraulic geometry. Tools presented in this chapter helps to reveal all of these features.<br />

The first relevant question in automatic hillslope analysis is to define what an hillslope is. The simplest<br />

way to do it is to first delineate the river network structure to his very detailed end. Channel links, previously


6. Hillslope analisys<br />

Figure 6.1: After [?]: <strong>di</strong>fferent processes acting on a hillslope<br />

defined, indentify in fact hillslopes. Two relevant type of link can be <strong>di</strong>stinguished: the internal links joining<br />

two nodes and the sources. Thus we have two types of hillslopes: those draining into first order streams (or<br />

magnitude 1 links) and those draining into the internal links. The channel head hillslope are the location<br />

of several relevant geomorphic processes as channel initiation, debris flow and various type of erosion as<br />

illustrated in the figure 6.1.<br />

Their extension is obviously affected by the channel initiation point. To any internal links there cor-<br />

responds two hillslopes, one on the hydrographic right and one on the hydrographic left. Since channels<br />

sometimes follows the tectonics the left and the right hillslope can <strong>di</strong>ffer from geology and lithology, how-<br />

ever their length is not affected by channel initiation.<br />

In any hillslope at leat two part can be <strong>di</strong>stingueshed: those which have positive (upward) and those<br />

which have negative (donwward) laplacian. Hill tops have negative laplacian and are convex hill bottoms<br />

have negative laplacian and are concave (for a finer delineation see the chapter on terrain classification). Hill<br />

tops and bottom are usually the product of <strong>di</strong>fferent process and should probably be analyzed separately.<br />

Accor<strong>di</strong>ng to [10] hillslope curvature and slope are not independent. When thinking to hillslope several<br />

times and without specification it is intended the convex part of it.<br />

The hillslope length is one of the most important characteristic of basins. It is the product of both the<br />

climate and the geo-lithology of the place. Its extent has a large influence on the hydrologic response because<br />

94


6. Hillslope analisys<br />

the water celerity in the hillslopes is much lesser than its celerity in the channels and it is, obviously, linked<br />

with the mean residence time of the water in the basin. This quantity substitutes the concept of drainage<br />

density defined as:<br />

D = Z<br />

At<br />

= E[L −1 ] (6.1)<br />

where Z is the subtended total length of the hydrographic network , and At its contributing area [e.g.<br />

[77]]. <strong>Horton</strong> showed [24] that, in the case of river networks, this quantity is inversely proportional to the<br />

expected value of the <strong>di</strong>stance covered to reach, from an arbitrary hillslope point, the nearest channel, L.<br />

The advantage of defining the hillslope extent in this way derives from the possibility of measuring from the<br />

maps and rivulets both quantities, A and L, while it is much more <strong>di</strong>fficult to calculate the pixel-network<br />

hydrographic <strong>di</strong>stance for all hillslope points, without possessing <strong>di</strong>gital data of the terrain. It was then an<br />

elegant conceptual exercise, used for compensating for the technical limitation of time.<br />

Figure 6.2: Map of the <strong>di</strong>stances from the net in Flanginec basin<br />

The use of <strong>di</strong>gital terrain data makes it possible to calculate <strong>di</strong>rectly the <strong>di</strong>stance of the channels from<br />

the net for each pixel, thus constituting a significant sample of the population of all hillslope points. In this<br />

work, instead of calculating the generic <strong>di</strong>stance of the points from the network, we preferred to calculate<br />

the <strong>di</strong>stances from the network following the maximum slope <strong>di</strong>rections. Therefore the mean length here<br />

calculated is not exactly equivalent to L (which would require the calculation of the <strong>di</strong>stance in all <strong>di</strong>rections)<br />

95


6. Hillslope analisys<br />

but it has surely greater hydrologic meaning, since these <strong>di</strong>rections, as already mentioned, represent the<br />

(mean) flow <strong>di</strong>rections of water.<br />

A representation of the hillslope length is given in Figure (6.3). The role of hillslope in the rainfall-runoff<br />

modelling has been described for instance in [11] and in references therein.<br />

96


6.2 Hillslope2ChannelDistance<br />

(h.h2cD)<br />

6. Hillslope analisys<br />

Description: It calculates for each hillslope pixel its <strong>di</strong>stance from the river networks, following the steepest<br />

descent (i.e. the drainage <strong>di</strong>rections). The program can work in two <strong>di</strong>fferent ways: it can calculate<br />

the <strong>di</strong>stance from the outlet either in number of pixels (0: topological <strong>di</strong>stance mode), or in meters<br />

(1: simple <strong>di</strong>stance mode).<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon, 2001<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the network (obtained with extractnetwork);<br />

Output:<br />

1. the file containing the <strong>di</strong>stance of every point from the river network;<br />

JGRASS Command: h.h2cD [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowmformat ] –net <br />

–netmapset [–netformat ] –h2c <strong>di</strong>st –h2c <strong>di</strong>stmapset <br />

[–h2c <strong>di</strong>stformat ] –mode [–usegui]<br />

Note: each river network pixel presents a value of <strong>di</strong>stance equal to 0.<br />

References: [11]<br />

Sources: h h2cD.java<br />

See Also: h2cD 3D<br />

97


6. Hillslope analisys<br />

Figure 6.3: Topological hillslope to channel <strong>di</strong>stance on tha basin Flanginec.<br />

98


6.3 Hillslope2ChannelDistance3D<br />

(h.h2cD3d)<br />

6. Hillslope analisys<br />

Description: It calculates for each hillslope pixel its <strong>di</strong>stance from the river networks, following the steep-<br />

est descent (i.e. the drainage <strong>di</strong>rections), considering also the vertical coor<strong>di</strong>nate (<strong>di</strong>fferently from<br />

<strong>di</strong>stance2outlet which calculates its projection only).<br />

Author and date: Erica Ghesla, Riccardo Rigon, 2005.<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the network (obtained with extractnetwork);<br />

3. the file containing the elevation (obteined with pitfiller);<br />

Output:<br />

1. the file containing the <strong>di</strong>stance of every point from the river network.<br />

JGRASS Command: h.h2cD 3D [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowmformat ] –net <br />

–netmapset [–netformat ] –pit –pitmapset [–pitformat<br />

] –h2c <strong>di</strong>stmapset<br />

[–h2c <strong>di</strong>stformat ] [–usegui]<br />

Note: each river network pixel presents a value of <strong>di</strong>stance equal to 0.<br />

References: This <strong>manual</strong><br />

Sources: h h2cD 3D.java<br />

See Also: h2cD<br />

99


6. Hillslope analisys<br />

Figure 6.4: Topological hillslope to channel <strong>di</strong>stance on tha basin Flanginec.<br />

100


6.4 Hillslope2ChannelAttribute<br />

(h.h2cA)<br />

6. Hillslope analisys<br />

Description: It is a simple way to select a hillslope or some of its property from the DEM. Since hillslope<br />

are identified by channel links, if a numbering of links is available, h2cattribute gives to any pixel<br />

draining into a given link the link number. Eventually, one can select all the hillslope points which<br />

share the same link number, i.e. the points which belongs to the same hillslope. Another use of this<br />

application (see [11]) is to associate to any hillslope point its channel path length. In general, it labels<br />

any hillslope pixel with the channel quantity found in the position where the hillslope pixel drains.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon, 2001<br />

Inputs:<br />

1. the file containing the matrix of the drainage <strong>di</strong>rections (obtained with markoutlets);<br />

2. the file containing the net (obtained with extractnetwork);<br />

3. the file containing the attribute to estimate (obtained with slope);<br />

Output:<br />

1. the file containing for each hillslope pixel the attribute of the network pixel in which it drains;<br />

JGRASS Command: h.h2cA [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset <br />

[–flowmformat ] –net <br />

–netmapset [–netformat ] –attribute –attmapset <br />

[–attformat ] –h2c attribute<br />

–h2c attributemapset [–h2c attribu<br />

teformat ] [–usegui]<br />

Notes: The program actually does NOT <strong>di</strong>stinguish between left and right hydrographic hillslope. This<br />

would be corrected soon.<br />

References: [11]<br />

Sources: h h2cA.java<br />

See Also: h2cD, linknumbering<br />

101


6. Hillslope analisys<br />

Figure 6.5: Hillslope2channelattribute calculated on the basin of the river Flan.<br />

102


6.5 Classification and ordering<br />

6. Hillslope analisys<br />

Since the early beginning of geomorphometric analysis, people tries to identify classes of topographic<br />

features. Geomorphometry tries to do it through a rigorous mathematical formalism. The approach imple-<br />

mented here for topography interpretation is (so far) very minimalistic, as explained by the following pages.<br />

The very basic in fact is to select classes on the base of planar and transversal curvature, i.e. about how<br />

much the gra<strong>di</strong>ents varies in selected curvilinear <strong>di</strong>rections: those of contour lines and drainage <strong>di</strong>rections<br />

respectively. To this respect geomorphometry ”is grounded in the concepts articulated by Gauss (...) as<br />

also, evidently, has been the curvature-based terrain work of [27]”, [57]. So minimalistic it is probably too<br />

much, since for instance other two main features are easily recognized to be physically important: the river<br />

network and the very high slope. The recognition of the first pattern has been largely treated in literature<br />

(e.g. see chapter 5), the latter is identified, for any geo-lithology, by the limit angle which separate ”uncon-<br />

<strong>di</strong>tionally unstable sites” from the other. Because the uncon<strong>di</strong>tionally unstable sites are actually there where<br />

you can see them, it is implied that the, uncon<strong>di</strong>tionally unstable words would refer to the fact that no soil<br />

(or se<strong>di</strong>ment) can be maintained against gravity at those slopes. Thus they are made or of solid rock or are<br />

formed by deposits at the critical coulomb angle.<br />

Among the form that are recognized in literature we cite<br />

• hillslopes<br />

• channels<br />

• terraces<br />

• alluvial fans (conoids)<br />

• cirques<br />

• hanging valleys<br />

• troughs<br />

• landslides<br />

and many others but these forms are not easy recognized by simple mathematical algorithms since by their<br />

definition or by the etherogeneity of natural forms (e.g. [19],[9]).<br />

A numerical classification of terrain, by types and regions (which is only cited here) can be found in [59],<br />

[8], [28],[9].<br />

103


6. Hillslope analisys<br />

6.6 GC (Geomorphic classes) (h.gc)<br />

Description: It sub<strong>di</strong>vides the sites of a basin in 11 topographic classes, nine of which are defined accor<strong>di</strong>ng<br />

[63] as shown in Figure 6.6. Such classes are the nine classes based (also in [3]) obtained with<br />

TC ; the points belonging to the channel networks constitute a tenth class (derived from the use of<br />

ExtractNetwork), the points with high slope (higher than a critical angle) the eleventh class.<br />

Author and date: Erica Ghesla 2005, Andrea Cozzini & Riccardo Rigon, 1999<br />

Inputs:<br />

1. the file containing the matrix of the slopes (obtained with slope or gra<strong>di</strong>ents);<br />

2. the file containing the matrix of the channel network (obtained with extractnetwork);<br />

3. the file with the matrix containing the sub<strong>di</strong>visions in curvature classes (obtained with TC);<br />

Output:<br />

1. the file containing the matrix containing the sub<strong>di</strong>vision in the 11 predefined classes;<br />

2. the file containing the matrix of the aggregated classes (hillslope, valleys and net);<br />

JGRASS Command: h.gc [–quiet] [–verbose] [–version] [–usage] –slope –slopemapset <br />

[–slopeformat ] –net –netmapset [–netformat ] –<br />

cp9map –cp9mapmapset [–cp9mapformat ] –classes<br />

–classesmapset [–classesformat ] –aggclass <br />

–aggclassmapset [–aggclassformat ] –th grad [–<br />

usegui]<br />

Notes: Differently from the program TC, the program GC considers also the existence of the channel net,<br />

which is extracted from the DEM. The channel net is thought as a topologically connected network,<br />

even though it is known that this cannot be the real case. The cases are identified as in TC plus:<br />

• 100 → channel sites (in<strong>di</strong>viduated by extract network)<br />

• 110 → uncon<strong>di</strong>tionally unstable sites (slope > critic value).<br />

The second output file contains an aggregation of these classes in the four fundamentals, indexed as<br />

follows:<br />

• 15 → non-channeled valley sites (classi 70, 90, 30 )<br />

104


• 25 → planar sites (classi 10)<br />

• 35 → channel sites (classe 100)<br />

• 45 → hillslope sites (classi 20, 40, 50, 60, 80)<br />

References: This <strong>manual</strong>, [3]<br />

Sources: casi.c, networks.c<br />

See Also: TC, nabla2<br />

105<br />

6. Hillslope analisys


6. Hillslope analisys<br />

Figure 6.6: Geomorphic classes after [63]<br />

Figure 6.7: Geomorphic classes obtained analysing the Flanginec river basin.<br />

106


Figure 6.8: Geomorphic aggregated classes obtained analysing the Flanginec river basin.<br />

107<br />

6. Hillslope analisys


6. Hillslope analisys<br />

6.7 TC (TopographicClasses) (h.tc)<br />

Description: It sub<strong>di</strong>vides the sites of a basin in the 9 topographic classes identified by the longitu<strong>di</strong>nal and<br />

transversal curvatures.<br />

Author and date: Andrea Antonello, Silvia Franceschi, Erica Ghesla, Silvano Pisoni, 2005, Andrea Cozzini<br />

& Riccardo Rigon, 1999<br />

Inputs:<br />

1. the file containing the matrix of the longitu<strong>di</strong>nal curvatures (obtained with curvatures);<br />

2. the file containing the matrix of the normal curvatures (obtained with curvatures);<br />

3. the threshold value for the longitu<strong>di</strong>nal curvatures;<br />

4. the threshold value for the normal curvatures;<br />

Output:<br />

1. the file containing the matrix of the 9 curvatures classes;<br />

2. the file containing the matrix of the concave, convex and planar sites;<br />

JGRASS Command: h.tc [–quiet] [–verbose] [–version] [–usage] –prof curv –prof curvmapset<br />

[–prof curvformat<br />

] –tang curv –tang curvmapset<br />

[–tang curvformat ] –cp3map<br />

–cp3mapmapset [–cp3mapformat<br />

] –cp9map –cp9mapmapset [–cp9mapformat ] –th prof –th tan [–usegui]<br />

Notes: The program asks as input the threshold values of the longitu<strong>di</strong>nal and normal curvatures which<br />

define their planarity (i.e. those sites presenting a curvature with absolute value lesser than the thresh-<br />

old). This is a value which has to be ”calibrated” for each basin. The program produces two <strong>di</strong>fferent<br />

output matrixes, one with the 9 classes ([3])schematized conventionally in the following way:<br />

• 10 → planar -planar sites<br />

• 20 → convex-planar sites<br />

• 30 → concave- planar sites<br />

• 40 → planar- convex sites<br />

108


• 50 → convex-convex sites<br />

• 60 → concave-convex sites<br />

• 70 → planar-concave sites<br />

• 80 → convex-concave sites<br />

• 90 → concave-concave sites.<br />

6. Hillslope analisys<br />

The second output file contains an aggregation of these classes in the three fundamentals, indexed as<br />

follows:<br />

References: [3]<br />

• 15 → concave sites (classes 30, 70, 90)<br />

• 25 → planar sites (class 10)<br />

• 35 → convex sites (classes 20, 40, 50, 60, 80).<br />

Sources: h tc.java<br />

See also: GC, nabla<br />

109


6. Hillslope analisys<br />

Figure 6.9: Topographic classes on the Flanginec river basin. 3 classes<br />

Figure 6.10: Topographic classes on the Flanginec river basin. 9 classes<br />

110


7 Statistics<br />

Statistics on DEMs can be made inside JGRASS by using specialized tools or exporting subset of data to<br />

the software R (http://www.r-project.org). However some tools of general interest are also included in The<br />

<strong>Horton</strong> Machine.<br />

7.1 SUMDOWNSTREAM<br />

(h.sumdownstream)<br />

Description: it sums the values of an assigned quantity from the point till the outlet. The final result is then<br />

a matrix of values containing the sum of the quantity in input on all upriver points: S = �<br />

ij Aj where<br />

i is the point examined and the index j varies on all points upriver with respect to the point examined.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Erica Ghesla, 2005, Riccardo Rigon, 1999<br />

Inputs:<br />

1. the file containing the drainage <strong>di</strong>rections;<br />

2. the file containing the quantity to sum;<br />

Output:<br />

1. the file containing the summed quantities.<br />

JGRASS Command: h.sumdownstream [–quiet] [–verbose] [–version] [–usage] –flow –flowmapset<br />

Note:<br />

[–flowformat ] –summap –summapset [–<br />

sumformat<br />

] –output –outputmapset [–outputformat ]<br />

[–usegui]


7. Statistics<br />

References: This <strong>manual</strong><br />

Sources: h sumdownstream.java<br />

Figure 7.1: Sumdownstream calculated on the Flanginec river basin.<br />

112


7.2 COUPLEDFIELD MOMENTS<br />

(h.cb)<br />

7. Statistics<br />

description: It calculates the histogram of a set of data contained in a matrix with respect to the set of data<br />

contained in another matrix. In substance, a map of R 2 → R 2 , in which each point of a bi<strong>di</strong>mensional<br />

system (identified by the values contained in a matrix) is mapped in a second bi<strong>di</strong>mensional system,<br />

is produced. The data of the first set are then grouped in a prefixed number of intervals and the mean<br />

value of the independent variable for each interval is calculated. To every interval corresponds a<br />

certain set of values of the second set, of which the mean value is calculated, and a designate number<br />

of moments which can be either centered, if the functioning mode is ’histogram’, or non-centered, if<br />

the mode is ’moments’. If the number of intervals assigned is lesser than one, the data are sub<strong>di</strong>vided<br />

in classes of data having the same abscissa.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Riccardo Rigon, 1998<br />

Inputs:<br />

1. file containing the data of the independent variable;<br />

2. file containing the data which will be used as dependent variable;<br />

3. the name of the output file;<br />

4. the first moment to calculate;<br />

5. the last moment to calculate;<br />

6. The insertion of an optional comment is also requested;<br />

Output:<br />

1. file containing: 1) the number of elements in each interval; 2) the mean value of the data in<br />

abscissa; 3) the mean value of the data in or<strong>di</strong>nate; n+2) the n-esimal moment of the data in<br />

or<strong>di</strong>nate.<br />

JGRASS Command: h.cb [–quiet] [–verbose] [–version] [–usage] –map1 –map1mapset <br />

[–map1ormat ] –map2 –map2mapset [–map2format ]<br />

–coupled –bins –firstmoment –secondmoment <br />

–bintype –binmode –base [–usegui]<br />

113


7. Statistics<br />

Notes: The program uses the memory intensely. Therefore if we decide to have so many intervals as the<br />

data in abscissa, the program could not function correctly. Moreover the program assumes that the<br />

real data are preceded by two arrays, like in the files derived from a DEM.<br />

References: This <strong>manual</strong>.<br />

Sources: h cb.java<br />

114


8 Hydro-geomorphic Indexes and relations<br />

Tra<strong>di</strong>tionally topographic features are related to hydrologic behavior through a simplified modeling<br />

which produces geomorphic proxies of hydrological quantities Below is presented the topographic index.<br />

The topographic index is a simple ratio between contributing area and slopes, here defined as:<br />

It = log A<br />

b∇z<br />

where A is the contributing area, b the length of the intercepted contour line of the pixel and ∇z the local<br />

slope. Such index [[14] can the proved to be linked with the formation of saturated zones within a basin<br />

owing to the hypodermic and subsurface flows accor<strong>di</strong>ng to simplified flow hypothesis. The logarithm<br />

present in (8.2) appears after the treatment of the problem by [31], who observed that, in most soils, the<br />

hydraulic conductivity decreases exponentially with depth. Then, calculated the probability <strong>di</strong>stribution for<br />

a basin:<br />

P [It = log A<br />

b∇z<br />

(8.1)<br />

> ξ(q)] = q (8.2)<br />

for each value of the quantile q (for example 0.1, correspon<strong>di</strong>ng to 10 per cent of saturated basin), the pixels<br />

which, most likely, are saturated, can be determined on the map. The points with the same topographic<br />

index value are called ”similar” from the hydrologic point of view.<br />

Obviously, many more hydro-geomorphologic indexes have been proposed; for further information see<br />

[1], [13] and [65].


8. Hydro-geomorphic Indexes and relations<br />

Figure 8.1: Saturated areas referred to Vagugn basin considering <strong>di</strong>fferent rates of saturation of the basin.<br />

116


8.1 TOPOGRAPHIC INDEX<br />

(h.topindex)<br />

8. Hydro-geomorphic Indexes and relations<br />

Description: It calculates the topographic index of a basin. It is defined as: log(A/s) − µ where: A is<br />

the contributing area in one point, s the slope and µ = 1<br />

N<br />

�<br />

i log(Ai/si) is the mean value of the<br />

logarithm over the whole basin (N is the number of pixels belonging to the basin). It is an index<br />

which is necessary to recognize the sites generating dunnian surface flow in a similar way. Sites with<br />

higher topographic index become saturated before than sites with lower topographic index.<br />

Author and date: Andrea Antonello, Andrea Cozzini, Silvia Franceschi, Erica Ghesla, Silvano Pisoni,<br />

2005, Marco Pegoretti, Riccardo Rigon, 1999<br />

Inputs:<br />

1. matrix of the drainage <strong>di</strong>rections;<br />

2. matrix of the contributing areas;<br />

3. the matrix of the slope;<br />

Output:<br />

1. matrix of the topographic indexes<br />

JGRASS Command: h.topindex [–quiet] [–verbose] [–version] [–usage] –tca –tcamapset <br />

Notes:<br />

[–tcaformat ] –slope<br />

–slopemapset [–slopeformat ] –topindex –<br />

topindexmapset <br />

–topindexformat [–usegui]<br />

References: [31], [80]<br />

Sources: h topindex.java<br />

117


8. Hydro-geomorphic Indexes and relations<br />

Figure 8.2: Saturated areas referred to Flanginec basin considering <strong>di</strong>fferent rates of saturation of the basin<br />

118


9 Geomorphology<br />

This section contains a preliminary implementations of the Shalstab stability model [79] and a linear<br />

model of equilibrium soil depth [2].<br />

9.1 TAU (h.tau)<br />

Description: Accor<strong>di</strong>ng to [26] TAU estimates, site by site, a proxy of the bottom shear stress due to surface<br />

runoff:<br />

τb =<br />

� g 2 kρ 3<br />

8ν c<br />

� 1<br />

3<br />

∗ S 2<br />

�<br />

3 ∗ q A<br />

� 2+c<br />

3<br />

− T S<br />

b<br />

where: g is gravity, k and c are parameters linked with the law expressing the resistance coefficient,<br />

ρ the water density, ν the cinematic viscosity of the water, S the local slope, q the effective rain per<br />

area unit, A the contributing area, b the draining boundary (which can be less than the pixel size), T<br />

the soil transmissivity.<br />

Authors and date: Erica Ghesla 2005, Andrea Cozzini & Riccardo Rigon, 1999<br />

Inputs:<br />

1. file containing the matrix of slopes (obtained with slope or gra<strong>di</strong>ents);<br />

2. file containing the matrix of the contributing areas per draining boundary unit (obtained with<br />

Output:<br />

alung);<br />

1. file containing the matrix of the stress tangent to the bottom;<br />

JGRASS Command: h.tau [–quiet] [–verbose] [–version] [–usage] –slope –slopemapset <br />

[–slopeformat ] –Ab –Abmapset [–Abformat


9. Geomorphology<br />

–taumapset [–tauformat ] –rho –g –ni –q <br />

–k –c –T [–usegui]<br />

Notes: The parameters necessary to estimate the stress tangential to the bottom are all expressed in the SI<br />

and data provided by the program through the file tau.init, as described in the paragraph . If the soil<br />

transmissivity is considered null (T =0), then we estimate the stress tangential to the bottom due to<br />

hortonian surface runoff, otherwise it is estimated on the basis of dunnian runoff.<br />

References: [26] [79] [48]<br />

Sources: h tau.java<br />

See Also: Ab, GRADIENT, SLOPE<br />

Figure 9.1: The map of tangential stress calculated on the basin Flanginec.<br />

120


9.2 SHALSTAB (r.shalstab.ft)<br />

Description: it is a version of the shalstab model, whose expression is:<br />

a<br />

b<br />

� �<br />

ρs tan θ<br />

≥ 1 − sin θ<br />

ρw tan Φ<br />

T<br />

q<br />

9. Geomorphology<br />

where a ìs the area contributing in one point, b the length of the boundary in the point considered; ρs<br />

the soil density; ρw the water density; θ the angular slope; Φ the friction angle; T the soil transmis-<br />

sivity; q the effective rain.<br />

Author and date: A. Cozzini & R. Rigon, 1999<br />

Inputs:<br />

1. matrix of the drainage <strong>di</strong>rections;<br />

2. file containing the matrix of the areas per length unit;<br />

Output:<br />

1. matrix of the <strong>di</strong>stances;<br />

GRASS Command: r.shalstab.ft drainage<strong>di</strong>rections=name alung=name output=<br />

Note:<br />

name<br />

References: [79]<br />

Sources: shalstab.c<br />

121


9. Geomorphology<br />

Figure 9.2: Stability con<strong>di</strong>tions on the Centa river basin calculated with the Shalstab. Green means unconitionally stable, violet<br />

means stable, red means unstable and yellow menas uncon<strong>di</strong>tionally unstable.<br />

122


9.3 SOIL DEPTH (r.soil depht.ft)<br />

9. Geomorphology<br />

Description: It calculates the soil depth in each pixel accor<strong>di</strong>ng to the linear theory developed by Dietrich<br />

et al.<br />

Author and date: M. Pegoretti & R. Rigon, 1999<br />

Inputs:<br />

1. the file containing the elevations;<br />

2. the file containing the parameters of the Dietrich model ;<br />

Output:<br />

1. matrix of the <strong>di</strong>stances<br />

GRASS Command: r.soil depht.ft elevations=name <strong>di</strong>etrichparameters=name <strong>di</strong>st=name<br />

Note:<br />

References: [2], [76]<br />

1. Heimsath, A. M and W. E. Dietrich, The soil production function and landscape equilibrium,<br />

Nature, 388: 358-361, 1997.<br />

2. Pegoretti, M.,Geomodel:implementazione <strong>di</strong> un modello scalabile <strong>di</strong> deflusso e bilancio idro-<br />

logico <strong>di</strong> bacino, Tesi <strong>di</strong> Laurea, Relatore R.Rigon, Universita’ degli stu<strong>di</strong> <strong>di</strong> <strong>Trento</strong>, A.A. 1997-<br />

98.<br />

Sources: soil depth.c, geomorphology.c<br />

123


A The fluidturtle format files<br />

The input files with ”fluidturtle” format used by the HORTON programs are ASCII files written accord-<br />

ing to what represented later on.<br />

/** This is a turtle file created on Oct 2 1999 at 19:11:20 by SELECTALL inputs<br />

processed :d:\tesisti\andrea\sopp\longo\SELECTALL */<br />

index{3,DEM} 3 1: float array dem header{10.000000,10.000000,5117280.000000,1680000.000000}<br />

2: float array novalue{-1,0}<br />

3: float matrix elevations{655,453}<br />

the strings which find themselves between the symbols “/**” e “*/” represent both comment lines which<br />

can be useful for understan<strong>di</strong>ng the type of data that the file contains.<br />

The first element that the file must read is a key string which represents the number of data blocks present<br />

within the file:<br />

index{3,DEM}.<br />

In the example reported the string says that the groups of data present are three; then come the three blocks<br />

with their hea<strong>di</strong>ngs. Also the keyword DEM is written to further specify the contents of the file.<br />

1:float array pixelsize{10.0,10.0,1680000.0,5117280.0}<br />

it in<strong>di</strong>cates that:<br />

• the block of data is the first one: (1:);<br />

• the data are floating-type data: (float);<br />

• is an array. An array is a data vector whose <strong>di</strong>mension is not specified explicitly: the array beginning<br />

and end are determined by the use of braces which contain the data:(array);<br />

• is called: (pixelsize).<br />

In the same way, the program reads the following lines of the file. It is enough remembering that the<br />

new block of data begins with the numeration of the block itself 1 and that a matrix always reports also the<br />

number of lines and columns between braces. 2 The files containing data relative to DEM are standar<strong>di</strong>zed<br />

and similar to the example in table 2.<br />

1 so the rea<strong>di</strong>ng of the file reported goes on as follows:<br />

• is the second block of data: (2:)<br />

• Is a floating-type array: (float array)<br />

• whose name is novalue: (novalue). Then follow the data between braces.<br />

2 to complete the rea<strong>di</strong>ng of the example file:<br />

• is the third block of data: (3:)<br />

• Is a double precision-type matrix: (double matrix)


Appen<strong>di</strong>x A<br />

• the first block always contains the DEM, pixel size and UTM coor<strong>di</strong>nates (in the first array the values:<br />

10.0,10.0) and the topographic coor<strong>di</strong>nates of the vertex at the bottom and on the left of the matrix<br />

with first the south coor<strong>di</strong>nate and then the west coor<strong>di</strong>nate (in the first array the values: 5117280.0,<br />

1680000.0).<br />

• the second block contains the value correspon<strong>di</strong>ng to the non-significant elevation NO-DATA or NO-<br />

VALUE (in<strong>di</strong>cating values either lacking or non-necessary or else external to the domain we want to<br />

analyze), preceded by an index telling that the value specified is either smaller than all the values of<br />

the data matrix (index=-1) or greater (in<strong>di</strong>ce=1). Let’s put the index equal to zero in case this is the<br />

value assigned to the term NODATA. In the case examined, the NODATA value is 0 and it is smaller<br />

than all the meaningful values.<br />

• the third and last block is the matrix of the real data whose <strong>di</strong>mensions are specified at the beginning<br />

in row×columns. In the case examined, 655 lines and 453 columns.<br />

• whose name is elev: (elev), followed by the number of lines and columns between braces: ({655,453}) and the data<br />

matrix whose elements in the column are separated by a blank space.<br />

126


List of Figures<br />

2.1 Models for structuring a network of raster elevation data: (a) squared network obtained by<br />

moving a submatrix 3×3 centered on the nodes; (b) triangulated irregular network-TIN; (c)<br />

network based on the contour lines. The contour lines can be used afterwards to sub<strong>di</strong>vide<br />

the area in irregular polygons together with the lines of maximum slope (which constitute<br />

the envelope of gra<strong>di</strong>ents) orthogonal to them [Moore and Grayson, 1990, Palacios and<br />

Cuevas, 1989; Moore, 1988; Moore and Grayson, 1989, 1990]. . . . . . . . . . . . . . . . 7<br />

2.2 Topography of Flanginec basin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8<br />

2.3 Statistics of the elevations of river Flanginec. For each elevation value the portion of area<br />

with highest elevation can be read in or<strong>di</strong>nate . . . . . . . . . . . . . . . . . . . . . . . . . 9<br />

2.4 The map of elevations without pit, calculated on the Flanginec river basin. . . . . . . . . . . 12<br />

2.5 The subbasins calculated on the Flanginec river basin. Hachstream = 2. . . . . . . . . . . . 14<br />

2.6 The map containing the basin. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16<br />

3.1 The slope of Flanginec basin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18<br />

3.2 Diagram of the possible topologies of river basin <strong>di</strong>scretization: (a) isotropic hexagonal<br />

structure; (b) isotropic squared four-<strong>di</strong>rection structure; (c) eight-<strong>di</strong>rection squared struc-<br />

ture (isotropic or not, depen<strong>di</strong>ng on how the <strong>di</strong>agonal <strong>di</strong>rections are weighted, i.e. topolog-<br />

ically or geometrically) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19<br />

3.3 The drainage <strong>di</strong>rections represented with reference to a generic pixel, i, in<strong>di</strong>cated here with<br />

“0”. In red, is shown the gra<strong>di</strong>ent <strong>di</strong>rection, in blue are the eight surroun<strong>di</strong>ng triangles, in<br />

green a linear estimation of the deviation of the gra<strong>di</strong>ent from the side <strong>di</strong>rection and in pink<br />

an angular estimation of the same quantity. . . . . . . . . . . . . . . . . . . . . . . . . . . 22<br />

3.4 How to assign the (σ) to the eight trangles (in blue). As above, in red, is the gra<strong>di</strong>ent, dash<br />

lines delimit the eight triangles, in green is the linear deviation and in pink the angular<br />

deviation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24<br />

3.5 Graphical elaboration of the contributing areas considering the flow accor<strong>di</strong>ng to the maximum-<br />

slope method referred to Flanginec basin. . . . . . . . . . . . . . . . . . . . . . . . . . . . 26<br />

3.6 The graphical description of the area A and the length of the contour line b. . . . . . . . . . 29<br />

3.7 The contour line in a pixel. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29<br />

3.8 The areas per length unit of the basin of the Flanginec river. . . . . . . . . . . . . . . . . . . 30


List of figures<br />

3.9 The contour line of the basin of the Flanginec river. . . . . . . . . . . . . . . . . . . . . . . 30<br />

3.10 The aspect of the basin of the Flanginec river. . . . . . . . . . . . . . . . . . . . . . . . . . 32<br />

3.11 The calculation of the planar curvature, the longitu<strong>di</strong>nal (profile) curvature and the planar<br />

curvature of the basin of the Flanginec river. . . . . . . . . . . . . . . . . . . . . . . . . . . 34<br />

3.12 The new drainage <strong>di</strong>rections of the basin of the Flanginec river. . . . . . . . . . . . . . . . . 36<br />

3.13 The total contributing areas calculated with the new drainage <strong>di</strong>rections. Flanginec river<br />

basin. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37<br />

3.14 The flow<strong>di</strong>rections of the basin of the Flanginec river. . . . . . . . . . . . . . . . . . . . . . 39<br />

3.15 The gra<strong>di</strong>ent calculated on the basin of the river Flanginec. . . . . . . . . . . . . . . . . . . 41<br />

3.16 The map of multitca calculated on the basin of the river Flanginec. . . . . . . . . . . . . . . 43<br />

3.17 The map of Laplance operetor calculated on the basin of the river Flanginec. . . . . . . . . 45<br />

3.18 The topographic calculated classes on the basin of the river Flanginec. . . . . . . . . . . . 46<br />

3.19 The slope calculated on the basin of the river Flanginec. . . . . . . . . . . . . . . . . . . . 48<br />

3.20 The total contributing area calculated on the basin of the river Flanginec. . . . . . . . . . . 50<br />

3.21 The total contributing area 3D calculated on the basin of the river Flanginec. . . . . . . . . 52<br />

4.1 Diameters calculated on the basin of the river Flanginec. . . . . . . . . . . . . . . . . . . . 55<br />

4.2 The euclidean <strong>di</strong>stance calculated on the basin of the river Flanginec. . . . . . . . . . . . . 57<br />

4.3 The mean drop calculated on the basin of the river Flanginec. . . . . . . . . . . . . . . . . . 60<br />

5.1 The network of the river Flanginec. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61<br />

5.2 Hack’s <strong>di</strong>stances from the devides referred to Flanginec basin. . . . . . . . . . . . . . . . . 64<br />

5.3 The topological <strong>di</strong>stance to outlet calculated on the basin of the Flanginec. . . . . . . . . . 65<br />

5.4 The real 3-<strong>di</strong>mensional <strong>di</strong>stance to outlet calculated on the basin of the Flanginec River. . . 67<br />

5.5 The drainage density calculated on the basin of the Flanginec. . . . . . . . . . . . . . . . . 69<br />

5.6 The network of the river Flanginec extracted with a treshold on the TCA. . . . . . . . . . . . 71<br />

5.7 Hacklengths calculated on the river Flanginec. . . . . . . . . . . . . . . . . . . . . . . . . 73<br />

5.8 Hacklengths 3-<strong>di</strong>mentional calculated on the river Flanginec. . . . . . . . . . . . . . . . . 75<br />

5.9 Map of HackStream calculated on the river Flanginec. . . . . . . . . . . . . . . . . . . . . 77<br />

5.10 The magnitudo calculated on the Flanginec river. . . . . . . . . . . . . . . . . . . . . . . . 80<br />

5.11 The net<strong>di</strong>f calculated on the Flanginec river using the map of elenations. . . . . . . . . . . . 82<br />

5.12 The subbasins calculated on the Flanginec river basin. . . . . . . . . . . . . . . . . . . . . 84<br />

5.13 The rescaled <strong>di</strong>stance on the river Flanginec basin. . . . . . . . . . . . . . . . . . . . . . . 86<br />

5.14 The rescaled <strong>di</strong>stance 3D on the river Flanginec basin. . . . . . . . . . . . . . . . . . . . . 88<br />

5.15 Strahler order in the basin of the river Flanginec. . . . . . . . . . . . . . . . . . . . . . . . 90<br />

6.1 After [?]: <strong>di</strong>fferent processes acting on a hillslope . . . . . . . . . . . . . . . . . . . . . . . 94<br />

128


List of figures<br />

6.2 Map of the <strong>di</strong>stances from the net in Flanginec basin . . . . . . . . . . . . . . . . . . . . . 95<br />

6.3 Topological hillslope to channel <strong>di</strong>stance on tha basin Flanginec. . . . . . . . . . . . . . . . 98<br />

6.4 Topological hillslope to channel <strong>di</strong>stance on tha basin Flanginec. . . . . . . . . . . . . . . . 100<br />

6.5 Hillslope2channelattribute calculated on the basin of the river Flan. . . . . . . . . . . . . . 102<br />

6.6 Geomorphic classes after [63] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106<br />

6.7 Geomorphic classes obtained analysing the Flanginec river basin. . . . . . . . . . . . . . . 106<br />

6.8 Geomorphic aggregated classes obtained analysing the Flanginec river basin. . . . . . . . . 107<br />

6.9 Topographic classes on the Flanginec river basin. 3 classes . . . . . . . . . . . . . . . . . . 110<br />

6.10 Topographic classes on the Flanginec river basin. 9 classes . . . . . . . . . . . . . . . . . . 110<br />

7.1 Sumdownstream calculated on the Flanginec river basin. . . . . . . . . . . . . . . . . . . . 112<br />

8.1 Saturated areas referred to Vagugn basin considering <strong>di</strong>fferent rates of saturation of the basin.116<br />

8.2 Saturated areas referred to Flanginec basin considering <strong>di</strong>fferent rates of saturation of the<br />

basin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118<br />

9.1 The map of tangential stress calculated on the basin Flanginec. . . . . . . . . . . . . . . . . 120<br />

9.2 Stability con<strong>di</strong>tions on the Centa river basin calculated with the Shalstab. Green means<br />

unconitionally stable, violet means stable, red means unstable and yellow menas uncon<strong>di</strong>-<br />

tionally unstable. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122<br />

129


List of figures<br />

130


Bibliography<br />

[1] Abrahams A. Channel networks: a goemorphological perspective. Water Resources Research,<br />

20(2):161–168, 1984.<br />

[2] Heimsath A. and Dietrich W. The soil production function and landscape equilibrium. Nature,<br />

388(6):358–361, 1997.<br />

[3] Parsons A. Hillslope form. Routledge, First e<strong>di</strong>tion, 1988.<br />

[4] Rinaldo A., R. Rigon, and I. Rodriguez-Iturbe. Channel networks. Annual Review of Earth and<br />

Planetary Sciences,, 26(2):289–327, 1998.<br />

[5] Schumm S. A. Evolution of drainage systems and badlands at perth amboy. Geol. Soc. America Bull.,<br />

67:602–611, 1956.<br />

[6] L. E. Band. Topographic partitions of watersheds with <strong>di</strong>gital elevation models,. Water Resour. Res.,<br />

22:15–24, 1986.<br />

[7] Band L. Distributed parameterization of complex terrain. Surveys in Geophysics, 12:249–270, 1993.<br />

[8] L.K Brabyn. Classification of macro landforms using gis. 1:26–40, 1997.<br />

[9] T. Cronin. Classifying hills and valleys in <strong>di</strong>gitized terrain. 66(9):1129–1137, 2000.<br />

[10] W. E. Dietrich, D. Bellugi, A. M. Heimsath, J. J. Roering, L. Sklar, and J. D. Stock. Geomorphic<br />

transport laws for pre<strong>di</strong>cting the form and evolution of landscapes. In Pre<strong>di</strong>ction in Geomorphology,<br />

P. Wilcock and R. Iverson, edts., volume 135 of IAGU Geophysical Monograph Series, pages 103–132,<br />

2003.<br />

[11] P. D’Odorico and R. Rigon. Hillslope and channels contribution to the hydrologic response. Water<br />

Resources Research, 39(5):1–9, 2003.<br />

[12] Scheidegger Adrian E. Theoretical geomorphology. Springer-Verlag, 1991.<br />

[13] Wilson J.P. e J.C. Gallant. Terrain Analysis. John Wiley & Sons, 2000.<br />

[14] O’Loughlin E.M. Precidtion of surface saturation zones in natural catchments by topography analysis.<br />

Water Resour. Res., 22:94–804, 1986.


Bibliografy<br />

[15] J. Fairfield and P. Leymarie. Drainage networks from grid <strong>di</strong>gital elevation models. Water Resour.<br />

Res., 27:709–717, 1991.<br />

[16] Tarboton David G. A new method for the determination of flow <strong>di</strong>rections and upslope areas in grid<br />

<strong>di</strong>gital elevation models. Water Resources Research, 33(2):309–319, 1997.<br />

[17] J. Garbrecht and L. W. Martz. Comment on ”a combined algorithm for automated drainage network<br />

extraction” by jean chorowicz et al. Water Resour. Res., 29(2):535–536, feb 1993.<br />

[18] J. Garbrecht and L.W. Martz. The assignment of drainage <strong>di</strong>rection over flat surfaces in raster <strong>di</strong>gital<br />

elevation models. Journal of Hydrology, 193:204–213, 1997.<br />

[19] Miliaresis G.Ch. and Argialas D.P. Segmentation of physiographic features from the global <strong>di</strong>gital<br />

elevation model / gtopo30. Comp. Geosc., 25(7):715–728, 1999.<br />

[20] Rigon R. I. Rodriguez-Iturbe A. Rinaldo A. Maritan A. Giacometti and D. Tarboton. On hack’s law.<br />

Water Resour. Res., 32(12):3363, nov 1996.<br />

[21] E. Waymire Gupta W.J. A representation of iuh from geomorphology. Water Resou. Res., 16:885–992,<br />

1980.<br />

[22] J. T. Hack. Stu<strong>di</strong>es of longitu<strong>di</strong>nal profiles in virginia and mariland. US. Geol. Sur. Prof. Paper,, 1947.<br />

[23] <strong>Horton</strong>. Erosional development of streams and their drainage basins: hydrophisical approach to quan-<br />

titative morphology. Bull. Geol. Soc. Am., 1945.<br />

[24] R. E. <strong>Horton</strong>. Drainage basins characteristics. Am. Geoph. Union Trans., 13:348–352, 1932.<br />

[25] W. Huber. Consideration generales sur les alpes centrales. 5:105ff, 1825.<br />

[26] Prosser I. and Abernethy B. Pre<strong>di</strong>cting the topographic limits to a gully network using a <strong>di</strong>gital terrain<br />

model and process threshold. Water Resources Research, 32(7):2289–2298, 1996.<br />

[27] Krcho J. Landscape as a spatially organized system and georelief as a subsystem of landscape—the<br />

influence of georelief on spatial <strong>di</strong>fferentiation of landscape proceses:.<br />

[28] Schmidt J. and Dikau. 1999, extracting geomorphometric attributes and objects from <strong>di</strong>gital elevation<br />

models—semantics, methods, future needs, in ,eds.,. In Dikau R. and H. Saurer, e<strong>di</strong>tors, GIS for<br />

Earth Surface Systems Analysis and Modelling of the Natural Environment, pages 153–173. Stuttgart,<br />

Stuttgart, 1999.<br />

[29] W. R. James and W. C. Krumbein. Frequency <strong>di</strong>stributions of stream link lengths. J. Geol., 77:544–<br />

565, 1969.<br />

132


Bibliografy<br />

[30] M. J. Woldenborg Jarvis R.S. River Networks, volume 80 of Benchmark Papers in geology. Hutchinson<br />

Ross Publishing Company, Stroudsburg, Penn, 1982.<br />

[31] Beven K. and Kirkby M. A physically based based variable contributing area model of basin hydrology.<br />

Hydrological Science Bulletin, 24(1), 1979.<br />

[32] Chorowicz J. C. Ichoku S. Riazanoff Y-J. Kim and B. Cervelle. A combined algorithm for automated<br />

drainage network extraction. Water Resour. Res., 28(5):1293–1302, may 1992.<br />

[33] Kirkby. Hillslope process-response models based on continuity equation. Slopes: form and process,<br />

Institute of British geographers, London, 1971, 1980, 1986.<br />

[34] Kirkby, M. A runoff simulation model based on hillslope topography. In Wood E. Gupte V.K,<br />

Rodriguez-Iturbe I., e<strong>di</strong>tor, Scale Problem in Hydrology. R. Reidel, Dordrecht, 1986.<br />

[35] Dorn A.J. Koenderink J.J. the structure of relief. 103:65–150, 1998.<br />

[36] Shreve R. L. Statistical law of stream numbers. J. Geol., 74:17–37, 1966.<br />

[37] Shreve R. L. Infinite topologically random channel networks. J. Geol., 75:178–186, 1967.<br />

[38] Shreve R. L. Stream lrnghts and basin areas in topologically random networks. J. Geol., 77:397–414,<br />

1969.<br />

[39] Zevenberg L. and C. R. Thorne. Quantitative analysis of land surface topography,. Earth Surf. Proc.<br />

Land., 12:47–56, 1987.<br />

[40] W. B. Langbein. US. Geol. Sur. Prof. Paper,, 968-C(1), 1947.<br />

[41] Costa-Cabral M. and Burgess S. Digital elavation model networks (demon) model of flow over hill-<br />

slopes for compution of contributing and <strong>di</strong>spersal areas. Water Resources Research, 30(6):1681–1692,<br />

1994.<br />

[42] Troutman B. M. and M. R. Karlinger. Gibbs <strong>di</strong>stribution on drainage networks. Water Resour. Res.,<br />

28(2):563–577, 1992.<br />

[43] Summerfield M.A. Global Geomorphology. Longman Singapore Publishers, Singapore, 1991.<br />

[44] J. Dozier Marks, D. and J. Frew. Automated basin delineation from <strong>di</strong>gital elevation data. 2:299–311,<br />

1984.<br />

[45] M. A. Melton. A derivation of strahler’s channel-ordering system. J. Geol., 67:345–346, 1959.<br />

133


Bibliografy<br />

[46] Mitásová Helena, Hofierka Jaroslav. Interpolation by regularized spline with tension: Ii. application<br />

to terrain modelling and surface geometry analysis. Mathematical geology, 25:657–669, 1993.<br />

[47] D.R. Montgomery and Dietrich W.E. Channel initiation and the problem of landscape scale. 255:826–<br />

830, 1992.<br />

[48] Foufoula-Georgiou Efi Montgomery David R. Channel network source representation using <strong>di</strong>gital<br />

elevation models. Water Resources Research, 29(12):3925–3934, december 1993.<br />

[49] Dietrich W.E. Montgomery D.R. Where do channels begin? Nature, pages 232–234, 1988.<br />

[50] Grayson R. Moore I. and Landson A. Digital terrain modelling: a review of hydrological, geological<br />

and biological applications. Hydrological Processes, 5(1):3–30, 1991.<br />

[51] B.J. Burch Moore I.D., E.M. O’Loughlin. A contour-based topographic model for hydrological and<br />

ecological applications. Earth Surf. Proc. Land-forms, 13:305–20, 1988.<br />

[52] R. Moussa. On morphometric properties of basins, scale effects and hydrological response. Hydrol.<br />

Proc., 17:33–58, nov 2002. DOI: 10.1002/hyp.1114.<br />

[53] Strahler A .N. Quantitative geomorphology of drainage basins and channel networks, chapter III-IV,<br />

pages 4–39 4–76. McGraw-Hill, New York, 1964.<br />

[54] J. O’Challagan and D.M. Mark. The extraction of drainage networks from <strong>di</strong>gital elevation data.<br />

Comput. Vision Graph., 28:323–344, 1984.<br />

[55] S. Orlan<strong>di</strong>ni, G. Moretti, M. Franchini, B. Al<strong>di</strong>ghieri, and B. Testa. Path-based methods for the de-<br />

termination of non<strong>di</strong>persive drainage <strong>di</strong>rections in grid-based <strong>di</strong>gital elevations models. Water Resour.<br />

Res., 39(6):1144, june 2003. DOI10.1029/2002WR001639.<br />

[56] S.D. Peckham. Efficient extraction of river networks and hydrologic measurements from <strong>di</strong>gital eleva-<br />

tion data. In O.E. Barndorff-Nielsen, e<strong>di</strong>tor, Stochastic Methods in Hydrology: Rain, Landforms and<br />

Floods. World Scientific, 1998.<br />

[57] Richard J. Pike. A bibliography of terrain modeling (geomorphometry), the quantitative rapresentation<br />

of topography. Open file report 02-465, USGS, 2002.<br />

[58] P. chevallier Quinn P., K. Beven and O. Planchon. The pre<strong>di</strong>ction of hillslope flow paths for <strong>di</strong>stributed<br />

hydrological modelling using <strong>di</strong>gital terrain models. Hydrol. Proc., 5(59):85–90, 1991.<br />

134


Bibliografy<br />

[59] Dikau R. Geomorphologische reliefklassifikation und -analyse (in german with english abstract).<br />

104:15–23, 1996. proposes nested landform hierarchies as multi-scale approach to geomorphome-<br />

try.<br />

[60] Montgomery D. R. and W.E. Dietrich. Source areas, drainage density and channel initiation. Water<br />

Resour. Res., 25:1907–1918, 1989.<br />

[61] Rigon R. Principi <strong>di</strong> auto-organizzazione delle reti fluviali. PhD thesis, University of Padova, Firenze,<br />

Genova e <strong>Trento</strong>, 1994.<br />

[62] Rigon R., I. Rodriguez-Iturbe, A. Maritan, A. Giacometti, D. Tarboton, and A. Rinaldo. On hack’s<br />

law. Water Resources Research, 32(11):3367–3374, 1996.<br />

[63] Suzuki R. Slope profiles and classification of slope types. Surveying no. 7, 43-50, 1977.<br />

[64] Rinaldo A. G. Vogel Rigon R. I Rodrigez-Iturbe. Can one gauge the shape of a basin? Water Res.<br />

Res., 31(4):1119–27, 1995b.<br />

[65] I. Rodriguez-Iturbe and A. Rinaldo. Fractal River Networks. Chance and Self-Organization. Cam-<br />

bridge University Press, New York, 1997.<br />

[66] Rodriguez-Iturbe I., J.B. Valdes. The geomorphic structure of hydrologic response. Water Resou. Res.,<br />

18(4):877–886, 1979.<br />

[67] Jenson S. and Dominque J. Extracting topographic structure from <strong>di</strong>gital elevation data for geographic<br />

information system analysis. Photogrammetric engineering and remote sensing, 54(11):1593–1600,<br />

1988.<br />

[68] Peckham S. New results for self-similar trees with applications to river networks. Water Resources<br />

Research, 31(4):1023–1070, 1995.<br />

[69] Peckham S. and VK Gupta. A reformulation of horton’s laws for large river networks in terms of<br />

statistical self-similarity. Water Resources Research, 35(9):2763–2778, 1999.<br />

[70] Jenson S.K. Applications of hydrologic information automatically extracted from <strong>di</strong>gital elevation<br />

models. Hydrological processes, 5:31–44, 1991.<br />

[71] J. S. Smart. The analysis of draiange network composition. 1976.<br />

[72] J.S. Smart. Statistical properties of stream lengths. Water Resour. Res., 4:1001–1014, 1976.<br />

[73] Freeman T. Calculating catchment area with <strong>di</strong>vergent flow based on a regular grid. Computers &<br />

Geoscience, 17(3):413–422, 1991.<br />

135


Bibliografy<br />

[74] D. G. Tarboton and D. P. Ames. Advances in the mapping of flow networks from <strong>di</strong>gital elevation data.<br />

In World Water and Env. Res. Congress Presented at 23rd ESRI International Users Conference, July<br />

7-11, 2003, San Diego, California. ASCE EWRI, 2001.<br />

[75] Bras R. Tarboton D. and Rodriguez-Iturbe I. The analysis of river basins and channel networks using<br />

<strong>di</strong>gital terrain data. Cambridge mass., Ralph M. Parsons Lab, M.I.T., Tech. Rep. no. 326, 1988.<br />

[76] Bertol<strong>di</strong> G. Rigon R. Over T.M. Impact of watershed geomorphic characteristics on the energy and<br />

water budgets. Journal of Hydrometeorology, 000(000):000, April 2006.<br />

[77] Tucker G. and E. Cattani and A. Rinaldo. Statistical analysis of drainage density from <strong>di</strong>gital terrain<br />

data. Geomorphology, 36:187–202, 2001.<br />

[78] C.E. von Sonklar. Die Zillerthaler Alpen, mit besonderer rucksicht auf orographie, gletscherkunde<br />

und geologie nach eigenen untersuchengen dargestellt, volume 32 of Petermanns Geographischen -<br />

supplement no 32. Justus Perthes, Gotha, 1862.<br />

[79] Dietrich W. and Montgomery D. A physically based model for the topographic control on shallow<br />

landsli<strong>di</strong>ng. Water Resources Research, 30(4):1153–1171, 1994.<br />

[80] Zhang W. and D.R Montgomery. Digital elevation model grid size, landscape representation, and<br />

hydrologic simulations. Water Resources Research, 30(4):1019–1028, April 1994.<br />

[81] C. Werner. Several duality theorems for interlocking ridge and channel networks. Water Resour. Res.,<br />

27(12):3237–3247, dec 1991.<br />

136

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!