ConvexHullProblem

Find the smallest volume that includes a given set of points and has only convex edges (no dents). Try in two, three or more dimensions.

• http://www.cse.unsw.edu.au/~lambert/java/3d/ConvexHull.html -- simple, 2d animation
• http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html -- animation of various algorithms