Course Description

This course will introduce basic data structures and algorithms as well as fundamental algorithms for computational geometry. Topics include but not limited to: basic data structures such (queue, stack, heap), sorting, greedy algorithm, divide and conquer, dynamic programming, sweeping line algorithm, arrangements, Delaunay triangulation, Voronoi diagram, range query, point location data structures. The course includes programming components as well.