Fall 2018 Course Descriptions

COMP 163-01 Computational Geometry

D. Souvaine
T 9:00-11:30, Anderson Hall 312
1 Block

(Cross-listed as MATH 163.)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 or permission of the instructor

Back to Main Courses Page