Geometric Algorithms

CAS CS 132

Basic concepts, data structures, and algorithms for geometric objects. Examples of topics: Cartesian geometry, transformations and their representation, queries and sampling, triangulations. Emphasis on rigorous reasoning and analysis, advancing algorithmic maturity and expertise in its application. (Counts as a CS Background Course for the concentration.) Formerly CAS CS 232, therefore cannot be taken for credit in addition to CAS CS 232.