(Created 2010-07-25.)

ALGORITHMS IN GEOGRAPHICAL INFORMATION SYSTEMS | TEK230 |

**Aim**

Students who have completed basic courses have studied basic GIS theory and learned to use GIS as a tool for geographic analysis. The aim of this course is to provide basic mathematical and computer science theory required in GIS. This knowledge is necessary for the evaluation of the results of an analysis as well as in the running of advanced analyses where there are no standard tools available.

*Knowledge and understanding*

For a passing grade the student must

- be able to explain the theory behind the most basic algorithms in GIS (for raster, vectors and graphs),
- be able to analyse spatial concepts and describe the definitions of these concepts,
- be able to suggest suitable approaches for the solution of geometric problems in GIS analyses,
- be able to describe and derive empirical transformation in the Cartesian plane, and
- be able to describe spatial data structures.

*Skills and abilities*

For a passing grade the student must

- be able to program basic algorithms used in GIS,
- be able to analyse and solve geometric problems, and
- be able to use graphical programming techniques.

*Judgement and approach*

For a passing grade the student must

- develop the ability to consider and assess possibilities and limitations of a GIS program.

**Contents**

The lectures deal with the basic theory of spatial databases as well as the most basic algorithms in GIS. The exercises are mainly directed towards using spatial databases and programming algorithms. The course ends with an individual project.

**Literature**

Worboys, M. F., and M. Duckham, 2004. GIS: A Computing Perspective, 2nd edition. Taylor & Francis.

Harrie, L., 2010. Lecture notes in GIS algorithms