This page summarizes the lectures and mentions the suggested reading assignments.
This summary is quite brief, and its intention is to help the student and
instructor recollect what was covered. It is no substitute for participating
in the lectures.
The slides we use in the first part of the course are by
Marc van Kreveld.
## Week 1

We covered the basic line segment intersection algorithm from Chapter 2.
The slides
we used are from
Marc van Kreveld.
## Week 2

Polygon triangulation from Chapter 3. The slides. We also spent some time looking at the
doubly-connected edge list representation for the decomposition obtained by
adding a set of non-crossing diagonals to a simple polygon.
## Week 3

Completing the polygon triangulation algorithm. Planar Convex Hulls from
Chapter 1. The slides.
## Week 4

Fixed dimensional linear programming from Chapter 4. The slides.
## Week 5

Orthogonal range searching from Chapter 5. The slides.
## Week 6

Completing the k-d tree data structure. The range tree,
another data structure for orthogonal range searching.
## Week 7

Completing certain aspects of the range tree structure -- fractional cascading, and handling degeneracies such as multiple points
with same x-coordinate, etc. Data structures for point location.
## Week 8

Point location: slides above.
## Week 9

Voronoi diagrams from Chapter 7. Connection to intersection of half-spaces in 3-d.
## Week 10

Midterm. Fortune's sweepline algorithm recapitulated.
## Week 11

Delaunay Triangulations from Chapter 9.
## Week 12

Arrangements and
Duality from Chapter 8.
## Week 13

Interval trees, priority search trees from Chapter 10. Slides on ICON.
## Week 14

Segment trees from Chapter 10 (slides on ICON) and
quadtrees based on these notes.
## Week 15

Completion of Quadtree discussion.