1. Computational Geometry Course Summary (First Half) Spring 2008 Pay special attention to: algorithm details (able to explain correctness and carry out a simple test case) time complexity

2. Convex Hull Algorithms –Jarvis’ march (gift wrapping) –Graham scan (Cartesian and polar versions) –Incremental; quickhull; divide and conquer

3. Point Location Algorithms –Polygon: shooting method –PSLG: slab, chain –Chain method & monotonization

4. Line Segment Intersection Algorithm: plane sweep; event points Time complexity

5. Polygon Triangulation Art gallery problem Algorithms: –General polygon Ear cutting Graham scan –Monotone polygon Linear time algorithm –Monotonelization via trapezoidization

6. Orthogonal Range Search 1D range search –Constructing balanced binary search tree 2D search using Kd tree –Kd tree construction –Kd tree and NN (nearest neighbor) finding