CS 504 Computational Geometry Instructor : Prof.

Choi, Sunghee TA : Lee, Yong June Office E3-1 3430 (Tel 3534)

Fall 2008

Syllabus

Office E3-1

Class Time : T/Th 16:00 17:30 Location : Classroom 4 (Room # 2445) Textbook : Computational Geometry: Algorithms and applications by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Springer. Goals : Computational geometry studies algorithms and data structures for geometric problems. In this course, we will study basic tools and fundamental algorithms/data structures of computational geometry so that students may be equipped with enough background to apply them in their work or to begin research in this area. Course outline : There will be homeworks, a midterm and final exam, and a term project. You submit a written project report and give a final presentation of your project at the end of the semester. Topics : The preliminary topics for the course include Convex hulls Intersection Triangulation Low dimensional linear programming Range searching Point location Voronoi diagram and Delaunay triangulation Arrangements and duality

Prerequisite : Graduate/undergraduate algorithms course (equivalent of CS300/500) Grading : Homework 20 %

Midterm Final Project

20 % 25 % 25 % 10 %

Participation