|
|
|
Lecture notes/slides will be posted here after class
(Beware: Some lecture slides will not be available online. I will note that in class before I teach
so that you can take notes if you want). We will also use
notes of Dr. David Mount.
Lecture 1: Introduction
Lecture 2: Nearest Neighbor Searching
Lecture 3: Convexity and Convex Hulls
Lecture 4: Visibility and Polygon Triangulation
Lecture 5: Linear Programming [ For Ashok's Class ]
Lecture 6: MEB
Lecture 7: Perceptrons and SVMs
Lecture 8: VC Dimension and epsilon Nets
Lecture 9: Orthogonal range searching
Lecture 10: Point Location
Lecture 11: Voronoi Diagrams and Delaunay Triangulations
Lecture 12: Robot Motion Planning
Lecture 13: Arrangements
Lecture 14: Surface Reconstruction
Lecture 15: Project Presentations
|