Chapters in geometric Algorithms, Fall 2001

Prof.  Klara  kedem

Course Description
Computational Geometry is the study of algorithms for solving geometric problems. The core of the field consists of a set of techniques for the design and analysis of such algorithms. It has deep connections to classical mathematics, theoretical computer science, and practical applications, that arise, e.g., in areas like computer vision, graphics, engineering, biology, and more.

In this course we will concentrate on shape matching problems and algorithms.

Format of the course

Each student or a pair of students will be given a paper to read, summarize, and talk about in the class.
In the first one or two classes I will survey the area.

Text book

Computational Geometry by de Berg, van Kreveld, Overmars and Schwarzkopf, Springer.

Links

www.cs.cornell.edu/Info/People/chew/Delaunay.html
www-cgrl.cs.mcgill.ca/~godfried/teaching/cg-web.html

Course requirements

• A printed summary of the paper should be handed in a week before the presentation (20%).

• A short meeting should be held two weeks before the talk to discuss how the talk is to be presented. Independent understanding of the paper is recommended (10%).

• A week later (a week before the talk) a full draft of the slides should be presented.

• A very good talk will get 50%.

• A one-hour exam will check  understanding of all the topics discussed in class (20%).

• Attendance is obligatory (-5% on each class missing). Unjustified delays are also penalized (5% per 1 day delay)

A full list of papers will be provided shortly.

Students Presentations:

First lecture - Lior's presentation

Second lecture - Seffi's presentation

Third lecture - Amir & Amit's presentation

Fourth lecture - Nira & Nir's presentation

Fifth lecture - Nadav's presentation

Sixth lecture - Noam & Gilad 

Seventh lecture - Irena Rabaev

Eighth lecture - Saar Yaniv

Ninth lecture - Sergey Tatrenko

Tenth lecture - Nir Sagiv

Eleventh lecture - Maayan Taragan & Nurit Grudinger