Spring 2020 Course Descriptions
COMP 163-01 Computational Geometry
MF 10:30-11:45, Aidekman Complex 012
E+ 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.