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
What I like so much about Computational Geometry is that it is very visual and intuitive, and even with the problems that are most difficult to solve, the problems themselves are often quite easily described and visualized. With a few simple props, I can explain many of the most fundamental problems in the field to somebody who has no background in computer science, no less computational geometry.
-- Prof. Dickerson
