MA518
Computational Geometry
0.5 Credit

This course studies efficient algorithms and their application to geometric problems. Topics include: convex hulls; line segment intersection; polygons, triangulations, and visibility; low dimension linear programming; range searching; point location search; arrangements of lines and hyperplanes; Voronoi and Delauney diagrams; and randomized algorithms. Topics may include: visibility graphs, shortest paths, and robot motion planning. Algorithms are implemented on the computer.