Close Menu
View Course Sections

Course Description

(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.Recommendations: COMP 160 or permission of instructor.

Affiliated With:

  • School of Engineering