Basic knowledge of algorithms and data structures for solving geometric problems
Subject
The lecture introduces fundamental problems, algorithms and data structures from the field of Computational Geometry. Among others, the following topics will be covered: Computation of convex hulls, triangulations, range searching, Voronoi diagrams, Delaunay triangulations.
Criteria for evaluation
Exam
Methods
Lecture
Study material
de Berg, van Krefeld, Overmars, Schwarzkopf. Computational Geometry. Springer.
see also www.ag.jku.at
Changing subject?
No
Further information
Necessary previous knowledge: Basic lectures in mathematics
Earlier variants
They also cover the requirements of the curriculum (from - to) 201GEOMCOGV14: VL Computational Geometry (2014S-2023S)
