In CS 425 we study algorithms and data structures for the solution to problems of a geometric and computational nature. Modern applications of computational geometry include geographic information systems, medical imaging, computer-aided design, and robotics. We will explore some famous problems in computational geometry, including convex hulls, Voronoi diagrams, proximity problems, and triangulations.


Prerequisites: CS 302

Computational Geometry is my own area of research, so I'm always excited for an opportunity to teach this elective. I think what drew me to it in the first place, and what continues to make it enjoyable to teach, is the nature of the types of problems we explore: the problems are often very simple and intuitive, with very fun applications: medical imaging, virtual reality, geographic information systems, robotics.
-- Prof. Dickerson