Show/hide contentOpenClose All
Curricular information is subject to change
On completion of this module students should be able to:- formulate, explain, link and compare the fundamental concepts and terminology related to spatial information - analyse data structures for spatial data and evaluate them in terms of storage requirements and efficiency - categorise spatial queries depending on the type of relations and basic algorithms they involve and reflect on their application - critically discuss the different approaches for spatial data storage and manipulation - identify, discuss and critically evaluate indexing techniques for accessing and querying different types of spatial data - identify, explain and generalise algorithms from the computational geometry literature for solving problems discussed in the course (e.g., topological querying, digital terrain modelling, visibility problems, etc.)
|Student Effort Type||Hours|
|Specified Learning Activities||
|Autonomous Student Learning||
Not applicable to this module.
|Resit In||Terminal Exam|
• Online automated feedback
• Self-assessment activities
Exercises with solutions.
|Lecture||Offering 1||Week(s) - 19, 20, 21, 22, 23, 24, 25, 28, 29, 30, 31, 32||Mon 15:00 - 15:50|
|Lecture||Offering 1||Week(s) - 19, 20, 21, 22, 23, 24, 25, 28, 29, 30, 31, 32||Tues 13:00 - 13:50|