548-0069/02 – Spatial Problems Algorithm Development (APU)
| Gurantor department | Department of Geoinformatics | Credits | 4 |
| Subject guarantor | doc. Ing. Michal Kačmařík, Ph.D. | Subject version guarantor | doc. Ing. Michal Kačmařík, Ph.D. |
| Study level | undergraduate or graduate | Requirement | Compulsory |
| Year | 1 | Semester | winter |
| | Study language | Czech |
| Year of introduction | 2014/2015 | Year of cancellation | 2021/2022 |
| Intended for the faculties | HGF | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
The main aim of the subject is to give students knowledge of subject, procedures and methods of computational procedures of spatial tasks. The goal is to understand and be able to explain and use basic algorithms and combine them to solve more complex spatial problems.
Teaching methods
Lectures
Tutorials
Summary
Algorithm, ways of algorithm description. Python language. Spatial algorithms for vector and raster data.
Compulsory literature:
NCGIA Core Curriculum on GIS.
Internet tutorials on Python language.
Recommended literature:
Mehta, P.: Handbook of Data Structures and Applications. Chapman & Hall/CRC Computer & Information Science Series, 2004. 1392 stran
Way of continuous check of knowledge in the course of semester
Knowledge of students during the course will be checked by constructing of several tasks for different types of algorithms.
E-learning
Other requirements
There are no other demands to the students.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
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.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction