548-0069/02 – Spatial Problems Algorithm Development (APU)

Gurantor departmentDepartment of GeoinformaticsCredits4
Subject guarantordoc. Ing. Michal Kačmařík, Ph.D.Subject version guarantordoc. Ing. Michal Kačmařík, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year1Semesterwinter
Study languageCzech
Year of introduction2014/2015Year of cancellation2021/2022
Intended for the facultiesHGFIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
KAC072 doc. Ing. Michal Kačmařík, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 1+2
Part-time Credit and Examination 3+6

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

Full-time form (validity from: 2014/2015 Winter semester, validity until: 2021/2022 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of pointsMax. počet pokusů
Exercises evaluation and Examination Credit and Examination 100 (100) 51
        Exercises evaluation Credit 33  17
        Examination Examination 67  30 3
Mandatory attendence participation: Attending at least of 80 % of classes.

Show history

Conditions for subject completion and attendance at the exercises within ISP: Lectures in the form of self-study of materials assigned by the lecturer. Possibility of personal or on-line consultation. Participation in exercises according to the student's capabilities. In order to receive credit, student must complete credit project no later than at the end of the examination period of the semester. The assignment of project will be provided by lecturer leading exercices. Examination must be taken in person.

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2021/2022 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2021/2022 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2020/2021 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2020/2021 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2019/2020 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2019/2020 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2018/2019 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2018/2019 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2017/2018 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2017/2018 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2016/2017 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2016/2017 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2015/2016 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2015/2016 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan
2014/2015 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics P Czech Ostrava 1 Compulsory study plan
2014/2015 (B1316) Geodesy, Cartography and Geoinformatics (3646R006) Geoinformatics K Czech Ostrava 1 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction



2020/2021 Winter
2019/2020 Winter
2018/2019 Winter
2017/2018 Winter
2016/2017 Winter
2015/2016 Winter
2014/2015 Winter