Computational Geometry Field of study: Computer Science
Programme code: W4-S2IN19.2021

Module name: Computational Geometry
Module code: W4-IN-S2-20-F-GO
Programme code: W4-S2IN19.2021
Semester:
  • summer semester 2022/2023
  • winter semester 2022/2023
  • summer semester 2021/2022
Language of instruction: Polish
Form of verification: course work
ECTS credits: 4
Description:
Aim of the classes is to introduce to the students the basics of computational geometry. Some of geometric problems that arise in practice, e.g., in robotics, GIS systems, computer games and methods of solving them in an efficient way (algorithms and dedicated data structures) will be presented. During the course, the students will prepare projects in teams of maximum two and present results of their work in the form of presentation in front of the group.
Prerequisites:
(no information given)
Key reading:
* Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Wprowadzenie do algorytmów, wyd. 7. PWN, Warszawa, (2015) * de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Geometria obliczeniowa algorytmy i zastosowania. WNT, Warszawa, (2007) * Hjelle, O., Daehlen, M.: Triangulations and Applications. Springer, Heidelberg, (2006) * O'Rourke, J.: Computational Geometry in C, 2nd Edition. Cambridge University Press, Cambridge, (1998) * Preparata, F.P., Shamos, M.I.: Geometria obliczeniowa. Wprowadzenie. Helion, Gliwice, (2003) * Sack, J.-R., Urrutia, J.: Handbook of Computational Geometry. Elsevier, Amsterdam, (2000) * Various research papers on computational geometry
Learning outcome of the module Codes of the learning outcomes of the programme to which the learning outcome of the module is related [level of competence: scale 1-5]
Knows and understands mathematical notions used in computational geomery, in particular: cross product, dot product, convex hull, Voronoi diagram [M_001]
 K_W01 [1/5]
Knows and understands the basic algorithms use in computational geometry. [M_002]
 K_W04 [1/5]
Knows and understands the basic principles of geometric algorithms creation. [M_003]
 K_W01 [1/5] K_W04 [1/5]
Can obtain information about computational geometry from literature, databases and other sources. [M_004]
 K_U01 [1/5] K_U07 [1/5]
Can prepare and present a presentation on execution of project's task. [M_005]
 K_U03 [1/5] K_U04 [1/5]
Can work individually and in a team. [M_006]
 K_U02 [1/5]
Can think and act creatively. [M_007]
 K_K01 [1/5] K_K03 [1/5]
Type Description Codes of the learning outcomes of the module to which assessment is related
Project [W_001]
Preparing the project and presentation of the chosen topic connected with computational geometry.
 M_001 M_002 M_003 M_004 M_005 M_006 M_007
Reports [W_002]
Solving sets of tasks.
 M_001 M_002 M_003 M_006 M_007
Form of teaching Student's own work Assessment of the learning outcomes
Type Description (including teaching methods) Number of hours Description Number of hours
lecture [Z_001]
Presenting educational content using audiovisual methods.
 15
Independent study of lecture topics and given literature.
 15 Project [W_001]
laboratory classes [Z_002]
Detailed preparation of the students to use of geometry algorithms in practice. Solving programming tasks.
 30
Familiarizing with subject of the laboratory. Familiarizing with subject of the project and preparing it in a team. Preparing a presentation of the project.
 60 Project [W_001] Reports [W_002]
Attachments
Module description (PDF)
Information concerning module syllabuses might be changed during studies.
Syllabuses (USOSweb)
Semester Module Language of instruction
(no information given)