- know different tasks in Computational Geometry and different approaches to solving them (k1);
- analyze complexity in terms of computing time and memory requirements for algorithms and data structures from algorithmic geometry (k4);
- analyze the robustness of geometric algorithms (k4);
- know algorithms for selected basic geometric problems and apply them to test data sets (k4);
- know principles for the design of geometric algorithms and classify methods accordingly;
|
Principles for designing geometric algorithms; selected problems and algorithms for dealing with them, including data structures; properties of selected discrete geometric structures; approaches to achieving robustness and complexity analysis.
|
