Geometric Algorithms are designed to solve Geometric Problems. They requires in-depth knowledge of different mathematical subjects like combinatorics, topology, algebra, differential geometry etc.

These algorithms has the following characteristics;

1. Relevant - they solve significant geometric problems for real world applications
2. Correct - they give accurate solutions for the problems
3. Robust - they tolerate small numerical errors and avoid overflow within constraints
4. Efficient - they are fast in practice for typical applications, both small and large
5. Conservative - they use few resources, such as storage space
6. Maintainable - they are straightforward to implement and troubleshoot
7. Elegant - one can understand why they work, which gives confidence in their use.

Course Structure