CSI 5127 Applied Computational Geometry
3 units
Computer Science
Faculty of Engineering
Design and analysis of efficient algorithms for solving geometric problems in applied fields such as Geometric Network Design, Geometric Routing and Searching. Geometric spanners, Greedy spanners, Theta-Graphs, Yao-Graphs, Well-Separated Pair Decomposition, Delaunay Triangulations. Introduction to the game of Cops and Robbers. This course is equivalent to COMP 5409 at Carleton University.
Components:
Lecture
Previously Offered Terms:
Winter