Course Description
This is an introductory course on computational geometry and its applications. We will discuss techniques needed in designing and analyzing efficient algorithms and data structures for computational problems in discrete geometry, such as convex hulls, geometric intersections, geometric structures such as Voronoi diagrams and Delaunay triangulations, arrangements of lines and hyperplanes, and range searching.
Course Format
In accord with Campus policies, lectures will be in person (see class time below). A number of changes have been implemented to deal with COVID-19. Please feel free to talk with me if you have any questions or concerns with the following.
- Students must comply with University COVID-19 policies. In particular, students are required to comply with campus mask mandates.
- Attendance in lectures is optional, and all lectures will be recorded. (At present, I do not plan to live-stream lectures over Zoom.)
- Homework (and any other class work) may be submitted electronically.
- Office hours will be conducted online through Zoom. If conditions permit, we may also have in-person office hours.
- Attendance is required for the midterm and final exam. (See the Syllabus for dates.)
Class Time
Tue, Thu 9:30am-10:45pm, CSIC 3117.
Course Staff
| Name | Role | Contact |
|---|---|---|
| Dave Mount | Instructor | mount@umd.edu |
| Shuhao Tan | Graduate TA | shuhao@umd.edu |
Office Hours
Office hours will be held through Zoom meetings. (We may relax this later to in-person office hours. If you would like to meet in person, you can request this through email.) If you cannot make the scheduled office hours, please feel free to contact any of us by email to set up an alternative time. We all allocate one hour per week for unscheduled office hours.
Piazza
Important class announcements will be made through Piazza. Once class has started, I'll send invitations to join the system.