1. Fixed-radius near neighbors searching
   
2. Convex hulls
   
3. Line segment intersection
   
4. Topological lower bounds I
   
5. Topological lower bounds II
   
6. Planar graphs
   
7. Polygons and triangulations
   
8. Orthogonal range searching
   
9. Segment trees
   
10. Introduction to randomized incremental algorithms
    
11. Point location
    
12. Introduction to linear programming
    
13. Seidel’s linear programming algorithm
    
14. Voronoi diagrams
    
15. Delaunay triangulations
    
16. The lifting map
    
17. Randomized incremental construction of the Delaunay triangulation
    
18. Point-line duality
    
19. Arrangements of lines
    
20. 3SUM and reductions
    
21. Geometric approximation algorithms I
    
22. Geometric approximation algorithms II
    
23. Quadtrees and approximate nearest neighbor searching
    
24. Compressed quadtrees
    
25. Shifted quadtrees
    
26. Dimension reduction