2018-2020 Undergraduate and Graduate Bulletin (with addenda) 
    
    May 25, 2020  
2018-2020 Undergraduate and Graduate Bulletin (with addenda)
Add to Portfolio

CS-GY 6703 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.

Prerequisite(s): Graduate status.
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0



Add to Portfolio