Computational Geometry

Overview

Computational geometry is the study of algorithms for geometrical problems. Many of these problems can be solved instantly by a person looking at a picture. (Example: is a point inside a polygon?) However, the computational solution of such problems is often non-trivial: it relies on the choice of appropriate data structures and on skillful implementation of linear algebra concepts.

Learning Outcomes

The aim of this course is to apply techniques taught in courses such as algorithm design and imperative programming to the design of geometrical algorithms. Throughout this course, the mathematical formulations are related to concrete code. The time and space complexity of most geometrical algorithms is discussed; often optimal algorithms are given for specific problems.

After the course you will be able to apply what you have learned in real geometrical applications. The practical itself is in Java, but no previous exposure to object-oriented programming is required.