| Course title | Computational Geometry |
|---|---|
| Course code | KI/A192 |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | Bachelor |
| Year of study | not specified |
| Semester | Winter and summer |
| Number of ECTS credits | 2 |
| Language of instruction | English |
| Status of course | Compulsory-optional |
| Form of instruction | Face-to-face |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Convex hull 2. Triangulation 3. Voronoi diagram 4. Nearest neighbor search 5. Range search 6. Point location 7. Line segment intersection 8. Polygon intersection detection 9. Polygon partitioning 10. Simplifying polygons 11. BSP tree and quadtree 12. Finding the shortest route 13. Minkowski sum
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
|
The course focuses on selected algorithms of computational geometry and their practical applications.
|
| Prerequisites |
|
unspecified
|
| Assessment methods and criteria |
|
unspecified
20-minute presentation of selected algorithm |
| Recommended literature |
|
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester | |
|---|---|---|---|---|
| Faculty: Faculty of Science | Study plan (Version): - (A14) | Category: Informatics courses | - | Recommended year of study:-, Recommended semester: - |