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
Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request