After successful completion of the course, students are able to (among others)

•     To judge geometric algorithms and data structures with respect to their runtime complexity,
•     To describe geometric algorithms and data structures,
•     Implement geometric algorithms and data structures in a problem-centered manner.

The content of this course covers the representation and analysis of geometric data using different algorithmic methods. This includes fundamental aspects of algorithms per se (definition, complexity analysis, efficiency). In particular, algorithms and data structures for simple and advanced geometric problems as well as sweep methods and spatial access methods are covered.

The content of the course explicitly includes the acquisition of the skills and abilities to solve these problems programmatically in Python.

 

Lecture, independently solving exercises (with help)

Students have two options regarding their course assessment:

Option 1) 100% of the assessment are achieved by means of the oral exam.

Option 2) A maximum of 30% of the assessment can be achieved through submission of three problem sets (more info will be given in week 1). The remaining 70% are achieved during the oral exam.

Working knowledge in Python.