In many areas of computer science- robotics, computer graphics, virtual reality, and geographic information systems are some examples- it is necessary to store, analyse, and create or manipulate spatial data. This course deals with the algorithmic aspects of these tasks: we study techniques and concepts needed for the design and analysis of geometric algorithms and data structures. Each technique and concept will be illustrated on the basis of a problem arising in one of the application areas mentioned above.
Through semester assessment (72%) and Final Exam (28%)
Students are assumed to have a basic knowledge of the design and analysis of algorithms and data structures: you should be familiar with big-O notations and simple algorithmic techniques like sorting, binary search, and balanced search trees.