An example of finding the convex hull containing a set of points. Algorithm from Computational Geometry by de Berg, et al
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.

An Implementation of the Convex Hull Algorithm for Processing

This sketch implements the Convex Hull Algorithm from Computational Geometry by deBerg et al. The algorithm takes a set of points and figures out which points beyond to the convex polygon that contains the full set. It does so in a slightly clever manner that is O(nlogn). The code is well-commented.

Video is available here: