CSC 426

Computational Geometry

Units: 1.5

Hours: 3-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.

Prerequisites:

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

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

Schedules:
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."