Detailed schedule

DateTopicResourcesProject
9/4Class intro & survey. Finding collinear points.intro.pdf, ex.pdfP0-setup
9/9Finding collinear points. Lab: review arrays, 2d arrays, vectors in c/c++collinear.pdfP1-closest
9/11Closest pair. Lab: header files and Makefiles.closest.pdf , ex.pdf 
9/16Point left of line primitive. Lab: OpenGL primer.leftOf.pdf 
9/16, 9/18Convex hull: properties and gift wrapping. Lab: OpenGL primer.hull1.pdf, ex.pdf 
9/23, 9/25Convex hull: Graham scan, Quickhull, Incremental, and lower bound.hull2.pdf, hull3.pdf, ex.pdfP2-hull2d
9/30Convex hull: divide-and-conquer. P3-mondrian
10/2Range searching and kd-trees.range-searching.pdf 
10/7FALL BREAK  
10/9Kd-trees, searching and analysiskdtrees.pdf 
10/14Range trees. Lab: OpenGLrangetrees.pdfP4-art gallery
10/16Range trees, continued. Lab: Using the mouse in OpenGL  
10/21Segment-segment intersection. Point-in-polygon tests and ray crossings.  
10/23Art gallery problems and Fisk sufficiency proofs. Lab: Animations in OpenGLartgallery.pdf 
10/28Art gallery problems - the proofs. Segment intersection with Bentley-Ottman sweep.bentley-ottman.pdf 
10/30Computing convex hulls in 3d. P5-hull3d
11/4Lab: OpenGL hull3d startup. Hull3d naive algorithm.hull3d.pdf 
11/6Hull3d: gift wrapping algorithm.  
11/11Hull3d: incremental algorithm and divide-and-conquer.  
11/13Polygon triangulation. Properties and triangulation by ear clipping.triangulation.pdf 
11/18class cancelled. P6-visgraph
11/20Combinatorial path planning. Point robot among obstacles in 2D: Path planning with the visibility graph.planning1.pdf 
11/25THANKSGIVING BREAK!  
11/27THANKSGIVING BREAK!  
12/2Combinatorial path planning. Polygonal robot moving among obstacles in 2D. Configuration space and extended obstacles.planning2.pdfP7-planning
12/4Heuristical path planning. A*, roadmaps and the RRT.planning3.pdf 
12/9Project.  
12/11Project.  
12/18final exam slot & project demo