Subject description - XP39CG

Summary of Study | Summary of Branches | All Subject Groups | All Subjects | List of Roles | Explanatory Notes               Instructions
XP39CG Advanced Computational Geometry
Roles:S Extent of teaching:2P+1C+4D
Department:13139 Language of teaching:
Guarantors:Felkel P. Completion:ZK
Lecturers:Felkel P. Credits:4
Tutors:Felkel P. Semester:Z


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.

Course outlines:

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

Exercises outline:


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



computational geometry;randomized algorithms

Subject is included into these academic programs:

Program Branch Role Recommended semester
DOKP Common courses S
DOKK Common courses S

Page updated 16.6.2024 17:52:04, semester: Z,L/2023-4, Z/2024-5, Send comments about the content to the Administrators of the Academic Programs Proposal and Realization: I. Halaška (K336), J. Novák (K336)