Skip to main content
Skip header
Close

Searching

Algorithmisation of Geometrical Problems

Algorithmisation of Geometrical Problems
456-0301/01
čeština

Summary

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

Literature

Mandatory:
1. Devadoss, S., L., O'Rourke, J.: Discrete and Computational Geometry, Princeton University Press, ISBN: 978-0691145532 , 2011
2. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications (Third edition), Springer-Verlag, ISBN: 978-3-540-77973-5 , 2008

Recommended:
1. J. O'Rourke, Computational Geometry in C, Cambridge University Press, ISBN-10: 0521649765 , ISBN-13: 978-0521649766 , 1998
2. P.F. Preparata and M.I. Shamos, Computational geometry: An Introduction, Springer, ISBN: 0-387-96131-3, 1985

Advised literature

1. J. O'Rourke, Computational Geometry in C, Cambridge University Press, ISBN-10: 0521649765 , ISBN-13: 978-0521649766 , 1998
2. P.F. Preparata and M.I. Shamos, Computational geometry: An Introduction, Springer, ISBN: 0-387-96131-3, 1985


back to search page
Language of instruction čeština
Code 456-0301
Abbreviation AGU
Course title Algorithmisation of Geometrical Problems
Coordinating department Department of Computer Science
Course coordinator doc. Dr. Ing. Eduard Sojka