Geographic data modeling. Raster and vector data structures and algorithms. Formulation and solution of Combinatorial optimization problems in GIS.
FAG3102 Computational Methods and Algorithms in GIS 7.5 credits
Information per course offering
Information for Autumn 2024 Start 28 Oct 2024 programme students
- Course location
KTH Campus
- Duration
- 28 Oct 2024 - 13 Jan 2025
- Periods
- P2 (7.5 hp)
- Pace of study
50%
- Application code
51485
- Form of study
Normal Daytime
- Language of instruction
English
- Course memo
- Course memo is not published
- Number of places
Places are not limited
- Target group
- No information inserted
- Planned modular schedule
- [object Object]
- Schedule
- Schedule is not published
- Part of programme
- No information inserted
Contact
Takeshi Shirabe 08-7906363 shirabe@kth.se
Course syllabus as PDF
Please note: all information from the Course syllabus is available on this page in an accessible format.
Course syllabus FAG3102 (Spring 2019–)Content and learning outcomes
Course contents
Intended learning outcomes
The major focus of this course is how to design, implement, and test algorithms for geographic information systems (GIS). Through reading assignments, lectures, seminars, and laboratory exercises, students should gain a good understanding of how GIS data and algorithms are designed, evaluated, and implemented, and also acquire computer programming skills useful to develop/extend GIS software and implement new GIS algorithms.
Literature and preparations
Specific prerequisites
A masters degree in geoinformatics, computer science, operations research, or relevant science and engineering fields. Documented proficiency in English B or equivalent.
Recommended prerequisites
A masters degree in geoinformatics, computer science, operations research, or relevant science and engineering fields. Documented proficiency in English B or equivalent.
Equipment
Literature
C. D. Tomlin, 1990, Geographic Information Systems and Cartographic Modeling, Prentice Hall. Or, C. D. Tomlin, 2012, Geographic Information Systems and Cartographic Modeling, ESRI Press.
M. F. Worboys and M. Duckham, 2004. GIS: A Computing Perspective, 2nd edition. Taylor & Francis.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, 1993, Network Flows: Theory, Algorithms, and Applications, Prentice Hall.
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
Examination
- PRO1 - Project assignment, 7.5 credits, grading scale: P, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
Opportunity to complete the requirements via supplementary examination
Opportunity to raise an approved grade via renewed examination
Examiner
Ethical approach
- All members of a group are responsible for the group's work.
- In any assessment, every student shall honestly disclose any help received and sources used.
- In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.