Computational Geometry and Its Applications

Graduate

The focus of this course is the design and analysis of algorithms and data structures to solve geometric problems. These problems arise from applied fields such as computer graphics, robotics, pattern recognition, wireless networks, geographic information systems (GIS), and surface modeling. Topics will include: convex hull algorithms, Voronoi diagrams, triangulations, point location, polygons, range searching, line arrangements, and matchings. (Prerequisite: B.Sc. [Hons, Computer Science] or with the permission of the instructor.) 267 Winter 2027 Academic Calendar