Skip to main content
Skip header
Terminated in academic year 2016/2017

Spatial Problems Algorithm Development

Type of study Follow-up Master
Language of instruction English
Code 548-0069/03
Abbreviation APU
Course title Spatial Problems Algorithm Development
Credits 5
Coordinating department Department of Geoinformatics
Course coordinator doc. Ing. Petr Rapant, CSc.

Subject syllabus

- The concept of algorithm, the importance of algorithms for spatial tasks in geoinformatics, the requirements of the algorithm, methods of registration algorithms, algorithm development, flowchart.
- The basic features of Python, why and what you can use Python for. Variables, data types, operators and expressions, logical expressions, numbers and strings, formatting.
- Lists (Field), tuples, and work with them. Conditions and cycles. The function definition functions.
- Sorting, searching - the most used algorithms vs.. built-in Python methods.
- Vector data - the intersection of lines, point in polygon, polygon intersection with the line, overlay operations with polygons, polygon triangulation.
- Dijkstra's algorithm, A * - finding the shortest path in the graph.
- Raster data - work with georeferenced raster images - image vs. map coordinates, determining the value of a pixel on the specified coordinates, affine transformation.
- Histogram of raster images - calculate the basic statistics characteristics.

Literature

NCGIA Core Curriculum on GIS.
Internet tutorials on Python language.

Advised literature

Mehta, P.: Handbook of Data Structures and Applications. Chapman & Hall/CRC Computer & Information Science Series, 2004. 1392 stran