Basic techniques, data structures, combinatorics, and algorithms for solving geometric problems. Examples are convex hulls, Voronoi diagrams, point set, and polygon triangulation. Range search, linear programming, and point location. Some theoretical and programming exercises.