Visualizing algorithms that I find interesting
#Gift wrap algorithm
Convex hull problem -- Given a set of points, find the smallest convex polyhedron/polygon containing all the points -- is a fundamental problem in computational gemoetry. Gift wrap algorithm is one of many algorithms to solve this problem.
