[Bowdoin Computer Science]

CS 3250: Computational Geometry

Spring 2017: T, Th 1:00 - 2:25 in Searles 126

Piazza link | Schedule | Using svn for this class | Assignments | Code

Computational geometry studies algorithms for problems that involve geometric data, such as finite sets of points, line segments and polygons. Some classical examples of geometric problems: Given the location of post-offices on a map, we may want to find the closest pair of post-offices. Or, we might want to find a triangulation of a set of surface samples that maximizes the minimum angle of a triangle ---- this type of meshing is often used in solid modeling, where small angles cause numerical instability. Or, given two sets of segments, we may want to find their intersections. This type of geometric problems arise in computer graphics, computer vision and image processing, robotics, and GIS.

Tentative syllabus:

This class will cover some basic computational geometry topics:

Prerequisites: Data Structures (cs2100) and Algorithms (cs2200) (or permission of instructor). In other words:


Office hours:

For quick questions, you can drop by any time you see my door open. This term we will be using Piazza for class discussion. The system is highly catered to getting you help fast and efficiently from classmates, the TA, and myself. Rather than emailing questions to the teaching staff, I encourage you to post your questions on Piazza. If you have any problems or feedback for the developers, email team@piazza.com. Find our class page here.

Class webpage:

Textbooks: The following are the classical, most popular textbooks and are suggested, not required. You can find them in Searles 224.

Grading policy: The grade will be based on:

Naturally the assignments will not be equal in length/difficulty. The last assignment might consitute a little project.