# Popis předmětu - XP39CG

Přehled studia | Přehled oborů | Všechny skupiny předmětů | Všechny předměty | Seznam rolí | Vysvětlivky               Návod
XP39CG Pokročilá výpočetní geometrie
Role:S Rozsah výuky:2P+1C+4D
Katedra:13139 Jazyk výuky:
Garanti:Felkel P. Zakončení:ZK
Přednášející:Felkel P. Kreditů:4
Cvičící:Felkel P. Semestr:Z

Anotace:

The aim of the course is to deepen the knowledge of computational geometry. The course is designed primarily for students who have a dissertation topic related to data structures in computer graphics and effective work with them. The starting point of the study will be chapters from the compulsory literature, specific topics will be based on scientific articles that develop the issue. Students will have the latest articles on the subject and will creatively process the theme. This is mainly about mastering the methodology of scientific work taking into account the subject of the dissertation. Precisely this aspect (the methodology of scientific work in the given field) is one of the added values ofthe subject. The subject, with its theoretical character, invites directly to the above-defined concept.

Osnovy přednášek:

 1 Randomized algorithms in CG (dynamic algorithms) 2 Randomized algorithms in CG (random sampling) 3 Simplex range searching (partition trees) 4. Simplex range searching (cutting trees) 5 Data-stream algorithms in CG 6 Kinetic data structures 7 Kinetic data structures 8 Sublinearalgorithms 9 Sublinearalgorithms 10 Polygon decomposition 11 Application of CG to GIS 12 Application of CG to GIS 13 Application of CG to Data Visualization 14 Reserve

Osnovy cvičení:

Literatura:

Mulmuley: Computational Geometry, An Introduction Through Randomized Algorithms, Prentice-Hall, 1994. Berg, M. de, Cheong, O., Kreveld, M. van, Overmars, M.: Computational Geometry. Algorithms and Applications, Springer-Verlag, Berlin, 3rd ed., 2008.
 J. R. Sack, J. Umrtia: Handbook of Computational Geometry, Elsevier, 1999.
Conference and journal papers