Preliminary Schedule:

1. (2010-03-04)
Art gallery theorems and polygon triangulation (pages 45-49)
Lecturer: Thomas
Handout download: see "News" page

2. (2010-03-11)
Sweepline algorithms, convex hulls, lower bounds (pages 1-15)
Line segment intersection (pages 19-29)
See also the History of the linear time convex hull of a simple polygon.
Lecturer: Thomas
Handout download: see "News" page

3. (2010-03-18)
Line segment intersection continued (pages 19-29)
Polygon partitioning (a.k.a. Polygon triangulation part 2) (pages 49-59)
Lecturer: Thomas
Handout download: see "News" page

4. (2010-03-25)
Polygon partitioning continued (pages 49-59)
Linear programming (pages 63-85)
Lecturer: Thomas
Handout download: see "News" page

5. (2010-04-01)
Orthogonal range searching I: kd-tress and range trees (pages 95-111)
Lecturer: Thomas
Handout download: see "News" page

-- (2010-04-08)
No lecture!!!

6. (2010-04-15)
Orthogonal range searching II: fractional cascading and interval trees (pages 111-115 and 219-226)
Lecturer: Thomas
Handout download: see "News" page

7. (2010-04-22)
Voronoi diagrams and Delaunay triangulation (pages 147-159)
Lecturer: Thomas
Handout download: see "News" page
The Voronoi Applet Thingy

8. (2010-04-29)
Delaunay Triangulations and proximity graphs (pages 191-199)
Reading material: Dilation and detour in geometric networks [pdf]
Lecturer: Thomas

9. (2010-05-06)
Planar point location (pages 121-144)
Lecturer: Thomas

10. (2010-05-13)
Arrangements and duality (pages 173-188)
Lecturer: Joachim

11. (2010-05-20)
Approximation algorithms: Applications of the WSPD
Reading material: The well-separated pair decomposition and its applications [pdf]
Lecturer: Joachim

12. (2010-05-27)
TBA
See also "Names in boxes" [pdf])