Designing efficient algorithms and data structures for geometric problems. Models of computation, convex hulls, geometric duality, multidimensional search, Voronoi diagrams and Delauney triangulations, linear programming
in fixed dimensions, lower bound techniques. Applications, advanced topics.
prereq: 5421 or instr consent