CSC 426

Computational Geometry

Units: 1.5

Hours: 3-0-0

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


  • CSC 226; and
  • minimum third-year standing.

Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.

Summer 2019 Fall 2019 Spring 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.