6.850 Geometric Computing
Introduction to the design and analysis of algorithms for geometric problems, in low- and high-dimensional spaces. Algorithms: convex hulls, polygon triangulation, Delaunay triangulation, motion planning, pattern matching. Geometric data structures: point location, Voronoi diagrams, Binary Space Partitions. Geometric problems in higher dimensions: linear programming, closest pair problems. High-dimensional nearest neighbor search and low-distortion embeddings between metric spaces. Geometric algorithms for massive data sets: external memory and streaming algorithms. Geometric optimization.
This class has 6.046 as a prerequisite.
6.850 will be offered this semester (Spring 2018). It is instructed by P. Indyk.
Lecture occurs 1:00 PM to 2:30 PM on Tuesdays and Thursdays in 32-124.
This class counts for a total of 12 credits.
You can find more information at the http://www.google.com/search?&q=MIT+%2B+6.850&btnG=Google+Search&inurl=https site.
© Copyright 2015 Yasyf Mohamedali