Grading: 70% homework (will be posted on this page), 30% final

Coverage: I hope to cover most of the topics in the textbook (convex hulls in 2D and 3D, map overlay and intersections, polygon triangulation, range searching, Delaunay triangulations and Voronoi diagrams, trapezoidal map, linear programming) plus some extra topics on discrete topology and surface reconstruction from points

---

Homework 1
Homework 2
Homework 3 Full text of problems
Flow complex papers - see the surface reconstruction and shape segmentation and matching papers
Crust paper
A paper on Contour Trees
Contour Tree topology
Final (email your solutions to me by Friday 4/30 midnight or slide under my office door)
Final Errata:

• Problem 6: replace `adjacent' by `disjoint'
  
• Problem 2: Assume the points x,y,z are always given in counterclockwise order