Gurantor department | Department of Computer Science | Credits | 4 |

Subject guarantor | doc. Dr. Ing. Eduard Sojka | Subject version guarantor | doc. Dr. Ing. Eduard Sojka |

Study level | undergraduate or graduate | Requirement | Optional |

Year | 2 | Semester | winter |

Study language | English | ||

Year of introduction | 2015/2016 | Year of cancellation | |

Intended for the faculties | FEI | Intended for study types | Follow-up Master |

Instruction secured by | |||
---|---|---|---|

Login | Name | Tuitor | Teacher giving lectures |

GAU01 | Ing. Jan Gaura, Ph.D. | ||

SOJ10 | doc. Dr. Ing. Eduard Sojka |

Extent of instruction for forms of study | ||
---|---|---|

Form of study | Way of compl. | Extent |

Full-time | Credit and Examination | 2+2 |

Part-time | Credit and Examination | 10+0 |

The student will understand the techniques of effectively solving the geometrical problems. He/she will be able to propose, implement and evaluate the corresponding algorithms.

Lectures

Tutorials

The following topics are discussed: The complexity of the problem and the complexity of the algorithm. Techniques of constructing effective geometrical algorithms. Effective data structures for solving the geometrical problems. Algorithmisation of selected geometrical problems: Point location in a planar map. Convex hull. Proximity problems. Voronoi diagram. Triangulation. Intersections. Visibility.

1. de Berg, M., van Kreveld M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications (Third edition), Springer-Verlag, ISBN: 978-3-540-77973-5, 2008.

1. Toth, C.D., Joseph O'Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry, 3rd Edition, CRC Press, ISBN 9781498711395, 2017.
2. Devadoss, S.L., O'Rourke, J.: Discrete and Computational Geometry, Princeton University Press, ISBN: 9780691145532 2011.
3. O'Rourke, J.: Computational Geometry in C, Cambridge University Press, ISBN 0-521-44034-3, ISBN 0-521-44592-2, 1994.
4. Preparata, P.F., Shamos, M.I.: Computational geometry: An Introduction, Springer, ISBN 0-387-96131-3, 1985.

Conditions for credit: The tasks assigned during the exercises must be carried out.
The xamination is oral.

No further requirements are imposed.

Subject has no prerequisities.

Subject has no co-requisities.

Lectures:
1. The complexity of a problem and the complexity of an algorithm. The complexity in the worst case, expected complexity. Models of computation. RAM, algebraic decision tree.
2. Estimating the lower bound of the worst case time complexity by making use of the transformation to the point location problem in En. Using the transformation between problems for estimating the lower bound of time complexity.
3. The data structures for storing the points in multi-dimensional spaces (k-d trees, quad/oct trees, BSP trees, interval trees, range trees).
4. Fundamental techniques of creating the effective algorithms: the plane sweeping method, divide and conquer method, prune and search method, randomised algorithms.
5. Point location problem. Determining the mutual position of a point and a simple polygon. Determining the position of a point in a planar map. Applications.
6. Convex hull. Algorithms for determining the convex hull in the two-dimensional space.
7. Convex hull in multi-dimensional spaces. Applications of convex hull.
8. The problems of distance and proximity. Finding the closest neighbours in E2 and in En.
9. Voronoi diagram. Constructing the Voronoi diagram. Solving the proximity problems by the Voronoi diagram.
10. Triangulation. Delaunay triangulation and its properties. Algorithms for computing the Delaunay triangulation. Triangulation of a simple polygon.
11. Intersections. Finding the intersections of a set of line segments in E2. Intersection of simple polygons.
12. Visibility graph. Computing the visibility graph for planar problems. Applications.
13. On the application of the algorithms discussed in the course: Planning the motion of a mobile robot.
14. Application of modeling the terrain in geographic systems.
Exercises:
During the exercises, the students construct the algorithms that solve given problems. They explain their algorithms in a critical discussion, and evaluate the time and space complexities of the algorithms they proposed.
1. Transformation between problems and estimating the lower bound of time complexity.
2. The search trees for storing the points in multi-dimensional spaces.
3. Plane sweeping method and its applications.
4. Point location problems: point vs polygon, point vs planar map.
5. Convex hull algorithms in the two-dimensional space.
6. Convex hull in multi-dimensional spaces.
7. The problems of distance and proximity. Finding the nearest neighbours.
8. Constructing the Voronoi diagram and its applications.
9. Delaunay triangulation, its computation and properties.
10. Finding the intersections of two polygons.
11. Computing visibility graph for planar problems.
12. Planning the motion of a mobile robot.
13. Modeling the terrain in geographic systems.
14. Summary and obtaining the credit.

Task name | Type of task | Max. number of points
(act. for subtasks) | Min. number of points |
---|---|---|---|

Credit and Examination | Credit and Examination | 100 (100) | 51 |

Credit | Credit | 25 | 12 |

Examination | Examination | 75 | 30 |

Show history

Academic year | Programme | Field of study | Spec. | Zaměření | Form | Study language | Tut. centre | Year | W | S | Type of duty | |
---|---|---|---|---|---|---|---|---|---|---|---|---|

2022/2023 | (N0613A140035) Computer Science | P | English | Ostrava | 2 | Optional | study plan | |||||

2021/2022 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2021/2022 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2020/2021 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2020/2021 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2019/2020 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2019/2020 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2019/2020 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | English | Ostrava | 2 | Optional | study plan | ||||

2019/2020 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2018/2019 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2018/2019 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2018/2019 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | English | Ostrava | 2 | Optional | study plan | ||||

2018/2019 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2017/2018 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2017/2018 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | English | Ostrava | 2 | Optional | study plan | ||||

2017/2018 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2017/2018 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2016/2017 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2016/2017 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | English | Ostrava | 2 | Optional | study plan | ||||

2016/2017 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2016/2017 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2015/2016 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | P | English | Ostrava | 2 | Optional | study plan | ||||

2015/2016 | (N2647) Information and Communication Technology | (1103T031) Computational Mathematics | K | English | Ostrava | 2 | Optional | study plan | ||||

2015/2016 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | English | Ostrava | 2 | Choice-compulsory | study plan | ||||

2015/2016 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | English | Ostrava | 2 | Choice-compulsory | study plan |

Block name | Academic year | Form of study | Study language | Year | W | S | Type of block | Block owner |
---|