CSC 526

Computational Geometry

Units: 1.5

An introduction to algorithms and data structures which are used to solve geometrical problems. Topics include geometric searching, convex polygons and hulls, Voronoi diagrams, plane sweep algorithms, proximity and intersections. Application areas discussed include computer graphics, VLSI design and graph theory.

Graduate course in the Computer Science program offered by the Faculty of Graduate Studies.

Fall 2019 Spring 2020 Summer 2020

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.