Skip to main content
Skip header
Close

Searching

Algorithmisation of Geometrical Problems

Algorithmisation of Geometrical Problems
460-4038/01
čeština Algorithmisation of Geometrical Problems
460-4038/02
angličtina

Anotace

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.

Povinná literatura

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.

Doporučená literatura

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.


zpět na vyhledávání
Language of instruction čeština, angličtina
Code 460-4038
Abbreviation AGU
Course title Algorithmisation of Geometrical Problems
Coordinating department Department of Computer Science
Course coordinator doc. Dr. Ing. Eduard Sojka