CSC274b
Spring 2000
Ileana Streinu

• Definition. Convex hull of a set of points. The planar case.
• Naive algorithms for convex hulls. Extreme points. Extreme edges. Complexity.
• Convex hull applet, 2d, animated - neat.
• Convex hull applet, another one.
• Break.
• Discussion of the next homework problem set 3. Cinderella assignement and machine shop alternative.
• Convex hull algorithms based on the sweep idea. Incremental algorithm. Rotational sweep: Graham's scan.
• Graham's scan applet.
• Next time, continue convex hull algorithms.

• Convex hull bibliography.
• Convex hull page at Stony Brook.
• Convex hull applet, 2d, animated - neat.
• Convex hull applet, another nice one.
• Graham's scan
• 3d convex hull applet.
• Clarkson code.