COMP 473 - Computational Geometry

Cross-Listed as MATH 473

Computational and discrete geometry is the study of geometric objects and algorithms for problems involving geometric input and output. It originally developed as a generalization of the study of algorithms for sorting and searching in 1-dimensional space to problems involving multi-dimensional inputs. Topics will likely include: polygons and polyhedra, convex hulls, Voronoi diagrams, triangulations, medial axis, linear optimization, search algorithms, and configuration spaces. This is a course in both theoretical and computational mathematics. Students will understand and apply definitions, work out examples both by hand and using a computer, investigate algorithms, and apply the tools learned in the class to a variety of applications. Coursework will involve problem sets, at least one exam (likely take-home), and a final project that includes a paper and presentation. An exploration of research articles and relevant literature will be a component of the course as well. Prerequisite(s): COMP 123 AND a 300-level MATH course (MATH 365 or MATH 379 are likely the most helpful). MATH 279 is also quite relevant. Every other fall. (4 Credits)