MU:MU24019 Geometric Algorithms - Course Information
MU24019 Geometric Algorithms
Mathematical Institute in OpavaWinter 2023
- Extent and Intensity
- 2/2/0. 6 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- RNDr. Vladimír Sedlář, CSc. (lecturer)
RNDr. Vladimír Sedlář, CSc. (seminar tutor) - Guaranteed by
- RNDr. Vladimír Sedlář, CSc.
Mathematical Institute in Opava - Timetable
- Mon 9:45–11:20 207
- Timetable of Seminar Groups:
- Prerequisites (in Czech)
- TYP_STUDIA(B)
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- General Mathematics (programme MU, Bc-M)
- Course objectives (in Czech)
- Tento předmět se bude zabývat problémy související s analýzou a návrhem efektivních algoritmů pro popis vlastností a vzájemných vztahů geometrických objetů a jejich aplikace.
- Syllabus
- Basic notions: analytic geometry, basic data structures, lower limit for sorting.
Convexity: convex hulls in E2 and E3.
Proximity: Voronoi diagrams, their generalizations and applications, triangulations, Delaunay trangulations and its applications
Geometric search and sorting: localization of a point in a polygon, in planar map
Intersections of geometric bodies: intersections of polygons, sets of segments, the kernel of a polygon and their 3D applications
Optimization problems: iteration, sweeping, ...
- Basic notions: analytic geometry, basic data structures, lower limit for sorting.
- Literature
- required literature
- Žára, J., Sochor, J. Algoritmy počítačové grafiky. ČVUT Praha, 1993. info
- Edelsbruner, H. Algorithms in Combinatorial Geometry. Springer Verlag, 1987. info
- recommended literature
- Sack, J. R., Urrutia, J. A., eds. Handbook of Computational Geometry. North-Holland, 2000. ISBN 0-444-82537-1. info
- Rourke:. Computational geometry in C. Cambridge University Press, 1998. info
- De Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O. Computational Geometry Algorithms and Applications. Springer, 1997. info
- not specified
- Jan Slovák,. Geometrické algoritmy I,. 1994. info
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
The course can also be completed outside the examination period.
- Enrolment Statistics (recent)
- Permalink: https://is.slu.cz/course/sumu/winter2023/MU24019