Fall 2021 Course Descriptions

CS 163-01 Computational Geometry

D. Souvaine
TR 9:00-10:15, Halligan Hall 108
T+ Block

(Cross-listed as MATH 181.)Design and analysis of algorithms for geometric problems. Topics include proof of lower bounds, convex hulls, searching and point location, plane sweep and arrangements of lines, Voronoi diagrams, intersection problems, decomposition and partitioning, farthest-pairs and closest-pairs, rectilinear computational geometry.

Prerequisite: COMP 160, COMP 170, any 100+ MATH course, or permission of the instructor.

Back to Main Courses Page