Common page for subjects B4M39VG, BE4M39VG, XP39CG.
Doodle closed, exam terms are in KOS.
The goal of computational geometry is the analysis and design of efficient algorithms for determining properties and relations of geometric entities. The lecture focuses on geometric search, point location, convex hull construction for sets of points in d-dimensional space, searching nearest neighbor points, computing intersection of polygonal areas, geometry of parallelograms. New directions in algorithmic design. Computational geometry is applied not only in geometric applications but also in common database searching problems.
You definitely should know the fundamental sorting and searching algorithms, understand the concept of operational and memory complexity, and be able to write programs in C++. Knowledge of linear algebra, fundamentals of computer graphics would also be an advantage.
Conditions for awarding of the assessment:
Students who receive the assessment are allowed to take the exam. The exam focuses on theoretical knowledge from the lectures, seminars, and individual studies. The exam has a written part and an oral part. Additional positive or negative points can be obtained during the oral exam (in the extrema, fundamental lack of knowledge may yield to a failure (F)).
For the exam, a maximum of 50 points can be awarded. A minimum of 25 points must be achieved for a passing grade:
Total points | Minimum for passing | |
---|---|---|
Seminars | 50 | 25 |
- Presentation (oral + slides) | 10 | 4 |
- Homework assignments | 40 | 20 |
Exam | 50 | 25 |
- written | 40 | 20 |
- oral | 10 | 5 |
The final grade is assigned according to the sum of seminars and exam points.
ECTS grade | Pass | Fail | ||||
---|---|---|---|---|---|---|
A | B | C | D | E | F | |
Points | 100-90 | 89-80 | 79-70 | 69-60 | 59-50 | 49-0 |