Skip to main content
Skip header
Ukončeno v akademickém roce 2021/2022

Spatial Problems Algorithm Development

Type of study Bachelor
Language of instruction English
Code 548-0069/04
Abbreviation APU
Course title Spatial Problems Algorithm Development
Credits 4
Coordinating department Department of Geoinformatics
Course coordinator doc. Ing. Michal Kačmařík, Ph.D.

Osnova předmětu

1) The concept of the algorithm, the importance of algorithms in geoinformatics spatial tasks, requirements on the algorithm notations, creating algorithms, flow chart.
2) The basic structure used in the implementation of algorithms - sequence, jump, condition, cycle.
3) Data types. Custom data types, their use for basic tasks - sorting, searching, indexing.
4) Vector data - the intersection of the lines, point in the polygon, polygon intersection with a line, overlay operations with polygons, polygon triangulation.
5) Graph tasks. Dijkstra's algorithm, A * - finding the shortest path in a graph.
6) Raster data - work with georeferenced raster image - image vs. map coordinates, determine the value of the pixel at the specified coordinates, affine transformation.
7) Reclassification of raster image, overlay operations, map algebra. Histogram of raster image - calculation of basic statistical characteristics.

Povinná literatura

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

Doporučená literatura

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