PřF:M7130 Geometric algorithms - Course Information
M7130 Geometric algorithms
Faculty of ScienceAutumn 2002
- Extent and Intensity
- 3/0/0. 3 credit(s) (fasci plus compl plus > 4). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- Teacher(s)
- prof. RNDr. Jan Slovák, DrSc. (lecturer)
- Guaranteed by
- prof. RNDr. Jan Slovák, DrSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: prof. RNDr. Jan Slovák, DrSc. - 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 Informatics (programme FI, N-AP)
- Informatics (programme FI, M-IN)
- Informatics (programme FI, N-IN)
- Mathematics (programme PřF, M-MA)
- Mathematics (programme PřF, N-MA)
- Course objectives
- A survey of Computational Geoemtry. We stress the comparison of various paradigms for algorithm design (one-way run, recursive `divide and conquer', sweep, randomized, geometric transformations), the necessary data structures, estimates for the worth-case or expected parameters
- Syllabus
- 1. Convex objects 2. Convex hulls 3. Voronoi diagrams and applications 4. Triangulations and plane divisions 5. Intersections 6. Range searching 7. Iso-orthogonal objects
- Literature
- učební text na www.math.muni.cz/~slovak
- DE BERG, M., M. VAN KREVELD, M. OVERMARS and O. SCHWARZKOPF. Computational Geometry. 1st ed. Berlin: Springer-Verlag, 1997, 365 pp. ISBN 3-540-61270-X. info
- Assessment methods (in Czech)
- písemná zkouška následovaná ústní rozpravou
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
The course is taught annually.
The course is taught: every week. - Teacher's information
- http://www.math.muni.cz/~slovak
- Enrolment Statistics (Autumn 2002, recent)
- Permalink: https://is.muni.cz/course/sci/autumn2002/M7130