Credit points: 3.0
Fundamental techniques, data structures and algorithms for solving geometric problems, such as computing convex hulls, intersection of line segments, the Voronoi diagram and Delaunay triangulation of a point set, polygon triangulation, range search, linear programming, point location in spaces of any dimension. Various topics in discrete geometry are also adressed (e.g., the crossing number of a graph).
Fundamental techniques, data structures and algorithms for solving geometric problems, such as computing convex hulls, intersection of line segments, the Voronoi diagram and Delaunay triangulation of a point set, polygon triangulation, range search, linear programming, point location in spaces of any dimension. Various topics in discrete geometry are also adressed (e.g., the crossing number of a graph).