PřF:M7130 Computational geometry - Course Information
M7130 Computational geometryFaculty of Science
- Extent and Intensity
- 2/0/0. 2 credit(s) (plus 2 credits for an exam). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- John Denis Bourke (lecturer)
Mgr. Tadeáš Kučera (assistant)
- Guaranteed by
- doc. RNDr. Martin Čadek, CSc.
Department of Mathematics and Statistics - Departments - Faculty of Science
Supplier department: Department of Mathematics and Statistics - Departments - Faculty of Science
- Mon 17. 9. to Fri 14. 12. Thu 16:00–17:50 A,01026
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 140 student(s).
Current registration and enrolment status: enrolled: 0/140, only registered: 0/140, only registered with preference (fields directly associated with the programme): 0/140
- fields of study / plans the course is directly associated with
- there are 6 fields of study the course is directly associated with, display
- Course objectives
- The aim of the course is to introduce basic algorithms of computational geometry. Passing the course students will know *basic algorithmic methods, *basic data and searching structures and *worst and expected times of the algorithms. *At the end of this course students will be able to implement the basic algorithms of computational geometry.
- Learning outcomes
- Passing the course students will know *basic algorithmic methods, *basic data and searching structures and *worst and expected times of the algorithms. *At the end of this course students will be able to implement the basic algorithms of computational geometry.
- 1. Convex hulls 2. Line segment intersections 3. Triangulations 4. Linear programming 5. Range searching 6. Point location 7. Voronoi diagram 8. Duality and arrangements 9. Delaunay triangulations 10. Convex haulls in dimension 3
- 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
- Teaching methods
- Assessment methods
- Written exam. Requirements: to manage the theory from the lecture, to be able to solve connected problems.
- Language of instruction
- Further Comments
- Study Materials
The course is taught annually.
- Teacher's information
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/sci/autumn2018/M7130