CSC274b
Spring 1998
Ileana Streinu

• Finish arrangements: Sweep line and incremental algorithms for arrangements.
• Convex hulls in 3d: preliminaries.
• Polyhedra, polytopes.
• Morphing polyhedra applet.
• Euler's formula. Estimates on number of edges and faces of a planar graph.
• Representation issues for 3d convex polyhedra. The 1-skeleton.
• Reading: textbook, Ch. 4.