Skip to main content
Skip header

Spatial Problems Algorithm Development

* Exchange students do not have to consider this information when selecting suitable courses for an exchange stay.

Course Unit Code548-0069/02
Number of ECTS Credits Allocated4 ECTS credits
Type of Course Unit *Compulsory
Level of Course Unit *First Cycle
Year of Study *First Year
Semester when the Course Unit is deliveredWinter Semester
Mode of DeliveryFace-to-face
Language of InstructionCzech
Prerequisites and Co-Requisites There are no prerequisites or co-requisites for this course unit
Name of Lecturer(s)Personal IDName
KAC072doc. Ing. Michal Kačmařík, Ph.D.
Summary
Algorithm, ways of algorithm description. Python language. Spatial algorithms for vector and raster data.
Learning Outcomes of the Course Unit
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.
Course Contents
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.
Recommended or Required Reading
Required Reading:
NCGIA Core Curriculum on GIS.
Internet tutorials on Python language.
1. Harms, D., McDonald, K.: Začínáme programovat v jazyce Python. Computer
press, Brno 2003, ISBN 80-7226-799-X
2. Staňková, J.,Staněk, F.: Vytváření a realizace algoritmů. Skriptum VŠB,
Ostrava
Recommended Reading:
Mehta, P.: Handbook of Data Structures and Applications. Chapman & Hall/CRC Computer & Information Science Series, 2004. 1392 stran
BAYER T. (2008): Algoritmy v digitální kartografii, nakladatelství Karolinum, skriptum, 250 s. PDF.
Planned learning activities and teaching methods
Lectures, Tutorials
Assesment methods and criteria
Task TitleTask TypeMaximum Number of Points
(Act. for Subtasks)
Minimum Number of Points for Task Passing
Exercises evaluation and ExaminationCredit and Examination100 (100)51
        Exercises evaluationCredit33 17
        ExaminationExamination67 30