How to make a straight line square -
Network analysis in raster GIS with time dependent cost variablesJan Husdal, MSc in GIS, University of Leicester, 1999-2000
3
Table of contents
1
INTRODUCTION AND OUTLINE .......................................................................... 6
2
AIMS AND OBJECTIVES ......................................................................................... 7
2.1 V
ISION
.................................................................................................................... 72.2 M
ETHODOLOGY
...................................................................................................... 72.3 E
XPECTED RESULTS
................................................................................................ 8
3
BACKGROUND RESEARCH AND LITERATURE REVIEW ............................ 9
3.1 G
RAPH THEORY AND FASTEST PATHS
...................................................................... 93.2 F
ASTEST PATH ALGORITHMS
................................................................................. 10
3.2.1
Static fastest paths ....................................................................................... 10
3.2.2
Dynamic fastest paths .................................................................................. 11
3.3 F
ASTEST PATHS IN RASTER
GIS ............................................................................ 12
3.3.1
Turning a surface into a network ................................................................. 12
3.3.2
Tomlin .......................................................................................................... 13
3.3.3
Eastman ....................................................................................................... 13
3.3.4
Douglas ........................................................................................................ 14
3.3.5
Xu and Lathrop ............................................................................................ 15
3.3.6
McIlhagga .................................................................................................... 16
3.3.7
Collischonn and Pilar .................................................................................. 18
3.3.8
Berry ............................................................................................................ 19
3.3.9
Network analysis or surface analysis ? ....................................................... 21
4
MFWORKS ................................................................................................................ 23
4.1 A
BOUT
MF
WORKS
................................................................................................ 234.2 N
ETWORK
A
NALYSIS IN
MF
WORKS
...................................................................... 234.3 MF
COM
................................................................................................................ 25
5
APPLICATION DEVELOPMENT ......................................................................... 26
5.1 D
ATA ACQUISITION
............................................................................................... 265.2 N
ETWORK MODELLING
......................................................................................... 26
5.2.1
Incremental Linkage – inferring linear features .......................................... 27
5.2.2
Directional Identifier – constraining directions .......................................... 28
5.3 C
OST SURFACE MODELLING
.................................................................................. 29
5.3.1
General considerations ................................................................................ 29
5.3.2
Determining travel cost and path length ..................................................... 30
5.4 I
MPLEMENTING A DYNAMIC COST SURFACE
.......................................................... 33
5.4.1
External application for updating cost surface ........................................... 33
5.4.2
Continuously updated cost surface .............................................................. 35
5.4.3
Time interval cost surface ............................................................................ 36
5.5 R
ECAPITULATING THE PROCESS
............................................................................ 38
6
DISCUSSION AND EVALUATION OF RESULTS ............................................. 39
6.1 C
HOICE OF SOFTWARE
.......................................................................................... 396.2 C
HOICE OF DATA
................................................................................................... 406.3 G
ENERAL ACCURACY
............................................................................................ 406.4 S
PREAD ARTEFACTS
.............................................................................................. 406.5 C
ONTINUOUSLY UPDATED COST SURFACE
............................................................. 43
Leave a Comment
I would also like to have a copy of this thiese for reference.
i am currently try to explore network analysis but using ARCGIS. May i had a copy of this thesis to enable me to make it as reference??