Course Websites

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: 1 to 4 undergraduate hours. 1 to 4 graduate hours. May be repeated in the same or separate terms if topics vary.

This course provides an introduction to the design and analysis of algorithms for solving geometric problems. Geometric data arise in many application areas. We will study the theoretical complexity of fundamental algorithmic problems in computational geometry, such as convex hulls, Voronoi diagrams/Delaunay triangulations, low-dimensional linear programming, line segment intersection, polygon triangulation, and more. Prerequisite: solid background in algorithms, at the level of CS 374. For up-to-date information about CS course restrictions, please view the following link for restrictions and release dates: http://go.cs.illinois.edu/csregister.