For a demonstration, follow this link!
To view the source code, follow this link!
For a discussion of the solution, follow this link!
SE 450 - Final Project
Solution to the Convex Hull Problem
in Computational Geometry
You might be curious as to what a Convex Hull is and what is the problem!
The convex hull of a set Q of points is the smallest convex polygon P for
which each point in Q is either on the boundary of P or in its interior.
In a convex polygon P, a line drawn between any two points will not cross the
boundry of P.
For a demonstration, follow this link!
To view the source code, follow this link!
For a discussion of the solution, follow this link!