Summary of Study |
Summary of Branches |
All Subject Groups |
All Subjects |
List of Roles |
Explanatory Notes
Instructions
Anotation:
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:
Literature:
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
Requirements:
Keywords:
computational geometry;randomized algorithms
Subject is included into these academic programs:
| Page updated 7.10.2024 17:51:07, semester: Z/2025-6, Z,L/2024-5, L/2023-4, Send comments about the content to the Administrators of the Academic Programs |
Proposal and Realization: I. Halaška (K336), J. Novák (K336) |