-
Fixed-radius near neighbors searching
-
Convex hulls
-
Line segment intersection
-
Topological lower bounds I
-
Topological lower bounds II
-
Planar graphs
-
Polygons and triangulations
-
Orthogonal range searching
-
Segment trees
-
Introduction to randomized incremental algorithms
-
Point location
-
Introduction to linear programming
-
Seidel’s linear programming algorithm
-
Voronoi diagrams
-
Delaunay triangulations
-
The lifting map
-
Randomized incremental construction of the Delaunay triangulation
-
Point-line duality
-
Arrangements of lines
-
3SUM and reductions
-
Geometric approximation algorithms I
-
Geometric approximation algorithms II
-
Quadtrees and approximate nearest neighbor searching
-
Compressed quadtrees
-
Shifted quadtrees
-
Dimension reduction