Fall 2015 Course Descriptions

COMP 163-01 Computational Geometry

G. Aloupis
TR 6:00p-7:30p, Anderson Hall 208

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 consent

Back to Main Courses Page