Course Detail
Units:
3.0
Course Components:
Lecture
Enrollment Information
Enrollment Requirement:
Prerequisites: CS 4150.
Description
Topics include: Convex hulls, Voronoi diagrams and Delaunay Triangulations, range searching, nearest neighbors, all in low and high dimension. Geometric duality, linear programming, Geometric approximations, High dimensional geometry and its relation to machine learning and data analysis.