Course Description:

• Algorithms and data structures for geometric computation and graphics programming. Fundamental problems of computational geometry such as convex hulls, Voronoi diagrams, Delaunay triangulations, polygon partitioning, arrangements, geometric searching, hidden surface elimination, motion planning.

Announcements:

• Dr. Goodrich will not be holding office hours on Wednesday, January 27, due to a prior commitment.
• Midterm 1, Thursday, January 28, 2016, in class. Reading: de Berg et al., Chapters 1-3. Old midterm exams are available:
  • midterm1
  • midterm2
  • midterm3
  • midterm4
• Midterm 2, Thursday, February 18, 2016, in class. Reading: Chapters 4-6.
• The lowest score among all the homeworks will be dropped in determining the final grade.
• Final Exam, Tuesday, March 15, 10:30am-12:30pm. In class. Reading: de Berg et al., Chapters 1-11. Old final exams are available:
  • final1
  • final2
  • final3
  • final4

Course Syllabus.

Homework Assignments.

Extra Course Notes.