A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
NIE-DVG Introduction to Discrete and Computational Geometry Extent of teaching: 2P+1C Instructor: Saumell Mendiola M. Completion: Z,ZK Department: 18101 Credits: 5 Semester: L Annotation:
The course intends to introduce the students to the discipline of Discrete and Computational Geometry. The main goal of the course is to get familiar with the most fundamental notions of this discipline, and to be able to solve simple algorithmic problems with a geometric component.
Lecture syllabus:
1. Introduction to Discrete and Computational Geometry 2. Convexity 3. Convex hull in two dimensions 4. Intersection of polygons 5. Triangulations of polygons and point sets 6. Voronoi diagram and Delaunay triangulation 7. Arrangements of lines 8. Duality transforms 9. Linear programming in two dimensions 10. Point location 11. Introduction to polytopes Seminar syllabus:
Discrete and Computational Geometry. Tutorial 3: Convexity. Tutorial 4: Convex hull in two dimensions. Tutorial 5: Intersection of polygons. Tutorial 6: Triangulations of polygons and point sets. Tutorial 7: Voronoi diagram and Delaunay triangulation. Tutorial 8: Semestral test. Tutorial 9: Arrangements of lines. Tutorial 10: Duality transforms. Tutorial 11: Linear programming in two dimensions. Tutorial 12: Point location. Tutorial 13: Polytopes.Literature:
Franco P. Preparata, Michael Ian Shamos. Computational Geometry: An Introduction. Springer, 1985. Mark Berg, Marc Kreveld, Mark Overmars, Otfried Cheong Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2000. Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth (ed.). Handbook of Discrete and Computational Geometry (third edition). CRC Press, 2017.Requirements:
The students are expected to be familiar with the basic notions of combinatorics, graph theory and analysis of algorithms.
Studijní materiály dostupné na https://courses.fit.cvut.cz/NIE-DVG The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester NIE-SI.21 Software Engineering 2021 V Není NIE-TI.21 Computer Science 2021 V Není NIE-DBE.2023 Digital Business Engineering V Není NIE-NPVS.21 Design and Programming of Embedded Systems 2021 V Není NIE-PSS.21 Computer Systems and Networks 2021 V Není NIE-PB.21 Computer Security 2021 V Není
Page updated 19. 4. 2024, semester: L/2020-1, L/2021-2, Z/2023-4, Z/2024-5, Z/2019-20, Z/2022-3, L/2019-20, L/2022-3, Z/2020-1, Z/2021-2, L/2023-4, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška