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.

Summer Fall Spring

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."