Course content

Algorithms in Geoinformation Systems

Code:

143217

Abbreviation:

B24B03

Higher education institution:

Faculty of Geodesy

ECTS credits:

3.0

Load:

30(E) + 15(E)

Issuing teachers:

Associate Professor Ana Kuveždić Divjak, PhD

Course contractors:

Associate Professor Ana Kuveždić Divjak, PhD (E)

Radan Vujnović (E)

Course description:

The course gives an overview of application of mathematics and computer science into geoinformation systems (GIS). Understanding algorithmic base of GIS is prerequisite for evaluation of results of GIS analysis and performing more complex spatial data analysis with typical GIS software. Spatial data structures and most important basic and more complex GIS algorithms are explained. Practical work includes implementation of known algorithms in selected programming language. Learning outcomes at the level of the programme to which the course contributes <ul><li>Maintain topographic, cartographic, maritime and navigation, and land information systems, integrate and visualise spatial information. <li>Use information technology in solving geodetic and geoinformation tasks. <li>Recognise problems and tasks in the application of geodetic and geoinformation principles and methods, and select proper procedures for their solution. <li>Keep pace with and adopt new technological achievements in the field of surveying, geoinformation systems and services based on the position, and the changes in regulations, norms and standards.</ul> Learning outcomes expected at the level of the course <ul><li>Describe theory behind basic algorithms for raster and vector data used for geoinformation processing. <li>Analyse and define concepts of spatial data structures. <li>Structure and solve geometrical problems in processing and anlaysis of geoinformation. <li>Write programs for basic algorithms used for geoinformation processing. <li>Evaluate existing geoinformation software by identifying advantages and constraints.</ul> Course content broken down in detail by weekly class schedule (syllabus) <ul><li>1. Introduction to course and computer programming. Review of basic data models: point, line, polygon. <li>2. Review and selection of programming language. Compiling and executing programs. <li>3. Calculating lines intersection. Calculating polygon centroid. <li>4. Length and area of polygon. Point in polygon. Polygons overlap. <li>5. Raster data - compression, quad-tree structure, area calculation, classification. <li>6. Data sorting. <li>7. Line simplification. <li>8. Overview of advanced algorithms. Shortest path in network. <li>9. Analysing and planning the implementation of selected algorithm. <li>10., 11., 12. Implementation of selected algorithm. <li>13. Algorithm and program testing. <li>14. Writing program documentation. <li>15. Presentation of project of algorithm implementation.</ul> Screening student work <ul><li>Class attendance - 0.5 ECTS <li>Practical training - 1 ECTS <li>Seminar essay - 1 ECTS <li>Written exam - 0.5 ECTS</ul>

Enrollment prerequisites:

Databases (passed)

Basics of Geoinformatics (passed)

Engineering Graphics in Geodesy and Geoinfromatics (passed)

Course in study programme:

Code	Name of study	Level of study	Semester	Required/Elective
71	Geodesy and Geoinformatics	undergraduate	4	elective

* the course is not taught in that semester

Legend

E - Seminar