Course Syllabus

- assignment 1.Version 1a (CORRECTED -
more to come)

- assignment 1.Version 1b (CORRECTED)

- Kirkpatrick-Seidel Optimal Output Sensitive Convex Hull Alg. .
- segment intersection
- triangulating an x-monotone polygon
- trace of line sweep alg. to repair merge vertices
- proof of the discrete ham-sandwich thm in the plane (dual form) - i.e. it shows "a ham-sandwich cut exists"
- diagram illustrating Megiddo's formulation of the two-dim linear programming problem.
- Parametric Search
- Example - Delaunay triangulation/Voronoi Diagram
- Megiddo's Parametric Search Paradigm

1. CURRENT ANNOUNCEMENTS I will use this page to give breaking news concerning the course. You should make a habit of referring to it on a regular basis.

2. Preparing for Class This page will show the material I intend to cover for each class. After the class I will update it to show what was actually covered.

3. A collection of Problems. These pages contain problems that were mentioned in class or relate to topics covered there. A (*) indicates a more challenging question. Check this document from time to time, as it will change and grow. I may ASSIGN some homework problems from this collection.

4. Homework Links:

5. Some Interesting Papers This page is actually a reading list, a small collection of interesting, accessible research papers: some of them contain the original work behind what is taught in class; some extend topics mentioned in class; most are tangential or even separate subjects from the lectures.

6. The midterm, and some solutions.

7. Some Handouts I have prepared.

8. The link to David Mount's U. Maryland LECTURE NOTES IN COMPUTATIONAL GEOMETRY.