Computer Science (CSC) Courses>Computational Geometry

CSC426 - Computational Geometry

Description

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.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Prerequisites

  • Complete all of the following
    • Complete all of:
      • CSC226 - Algorithms and Data Structures II (1.5)
    • minimum third-year standing.

Course offered by

Department of Computer Science

Course schedules

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

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.