548-0923/01 – Spatial Problems Algorithm Development (APU)

Gurantor departmentDepartment of GeoinformaticsCredits10
Subject guarantordoc. Ing. Petr Rapant, CSc.Subject version guarantordoc. Ing. Petr Rapant, CSc.
Study levelpostgraduateRequirementChoice-compulsory
YearSemesterwinter
Study languageCzech
Year of introduction2009/2010Year of cancellation2018/2019
Intended for the facultiesHGFIntended for study typesDoctoral
Instruction secured by
LoginNameTuitorTeacher giving lectures
RAP30 doc. Ing. Petr Rapant, CSc.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Examination 20+0
Combined Examination 20+0

Subject aims expressed by acquired skills and competences

Subject will provide students with contetnt, procedures and methods of spatial problems algorithm development. Students will be able to explain and apply basic algorithms and combine tham to solve complex spatial problems.

Teaching methods

Individual consultations

Summary

Algorithms, their properties, ways of description and development. Python. Algorithms for processing of vector and raster data.

Compulsory literature:

Worboys, M., Duckham, M.: GIS: a Computational Perspective. Second Edition. CRC Press, Boca Raton, 2004. 426 str.

Recommended literature:

NCGIA Core Curriculum in Geographic Information Science. http://www.ncgia.ucsb.edu/giscc/

Way of continuous check of knowledge in the course of semester

Individual consultations.

E-learning

Další požadavky na studenta

No additional requirements are imposed on the student.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

The concept of the algorithm, the importance of algorithms in solving spatial tasks, requirements on the algorithm notations, creating algorithms, flow chart. Vector data - the intersection of the lines, point in the polygon, polygon intersection with the line, polygon overlay operations, distance of a point from the line/polygon, Thiessen polygons. Generalization lines. Graphs - Representation of graphs, depth-first search, breadth-first search. Dijkstra's algorithm - finding the shortest path in a graph. Interpolation method. Raster data - work with georeferenced raster image. Reclassification of raster image, overlay operations, map algebra, filtering. Histogram of raster image - calculation of basic statistical characteristics.

Conditions for subject completion

Full-time form (validity from: 2013/2014 Winter semester, validity until: 2018/2019 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Examination Examination  
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2018/2019 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2018/2019 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2017/2018 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2017/2018 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2016/2017 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2016/2017 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2015/2016 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2015/2016 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2014/2015 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2014/2015 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2013/2014 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2013/2014 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2012/2013 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2012/2013 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Choice-compulsory study plan
2011/2012 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Choice-compulsory study plan
2010/2011 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Optional study plan
2010/2011 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Optional study plan
2009/2010 (P3646) Geodesy and Cartography (3602V002) Geoinformatics P Czech Ostrava Optional study plan
2009/2010 (P3646) Geodesy and Cartography (3602V002) Geoinformatics K Czech Ostrava Optional study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner