MU:MU24013 Geometric Algorithms - Course Information

MU24013 Geometric Algorithms

Extent and Intensity

2/2/0. 6 credit(s). Type of Completion: z (credit).

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

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

• Applied Mathematics (programme MU, N1101)

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, ...

Literature

recommended literature
• Sack, J. R., Urrutia, J. A., eds. Handbook of Computational Geometry. North-Holland, 2000. ISBN 0-444-82537-1. info
• De Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O. Computational Geometry Algorithms and Applications. Springer, 1997. info
• Žára, J., Sochor, J. Algoritmy počítačové grafiky. ČVUT Praha, 1993. info
• Edelsbruner, H. Algorithms in Combinatorial Geometry. Springer Verlag, 1987. info

Language of instruction

Czech

Further comments (probably available only in Czech)

The course can also be completed outside the examination period.

• Enrolment Statistics (Winter 2018, recent)
  
• Permalink: https://is.slu.cz/course/sumu/winter2018/MU24013