Computational Geometry

(3 Credits)

This course introduces data structures and algorithms for geometric data. Topics include intersection, polygon triangulation, linear programming, orthogonal range searching, point location, Voronoi diagrams, Delaunay triangulations, arrangements and duality, geometric data structures, convex hulls, binary space partitions, robot motion planning, quadtrees, visibility graphs, simplex range searching. | Knowledge of algorithms and data structures equivalent to CS-GY 6033 . Prerequisite: Graduate Standing.