Week 1 [1/25, 1/27] 
Introduction. Finding collinear points. Finding the closest pair of points.

Week 2 [2/2, 2/4] 
Geometric primitives (area of a triangle, collinear, leftof, segment intersection).

Week 3 [2/9, 2/11] 
Convex hulls in 2D: Properties, algorithms (gift wrapping, Quickhull, Graham scan, Andrew's monotone chain, incremental, divideandconquer) and lower bound.

Week 4 [2/16, 2/18] 
Convex hull wrap up; convex hull in 3D.
Line segment intersection: Orthogonal segment intersection. General linesegment intersection and BentleyOttman sweep.

Week 5,6 [2/23, 2/25, 3/1, 3/3] 
Range searching: kdtrees. Range trees.

Week 7 [3/8, 3/10] 
Intersections: Segmentsegment intersection (computing intersection coordinates). Pointinpolygon test (point in convex polygon; point in nonconvex polygon via raycrossing).

Week 8 [3/29, 3/31] 
Art gallery problems. Definition and properties. Fisk's sufficiency proof.

Week 9 [4/5, 4/7] 
Polygon triangulation (Polygon triangulation in quadratic time via ear removal. Triangulating monotone mountains. An O(n lg n) triangulation algorithm via trapezoidalization and partition into monotone mountains).

Week 10 [4/12, 4/14] 
Voronoi diagrams.

Week 11 [4/19, 4/21] 
Delaunay triangulations.

Week 12 [4/26, 4/28] 
Motion planning.

Week 13 [5/3, 5/5] 
Motion planning

Week 14 [5/10] 
Last class: demos and donuts. 