Topics covered in this course include convex hulls, triangulations, Art Gallery theorems, Voronoi diagrams, Delaunay graphs, Minkowski sums, path finding, arrangements, duality, and possibly randomized algorithms, time permitting. Throughout the course, students explore various data structures and algorithms. The analysis of these algorithms, focusing specifically on the mathematics that arises in their development and analysis is discussed. Although CS 330 is not a prerequisite, it is recommended.
Prerequisites
MAT 250, MAT 258