Computing the convex hull of a set of points is a fundamental problem in the field of computational geometry. For those unaware of what a convex hull is: in 2D, imagine snapping an elastic band around a set of points - the convex hull is the set of points that form the perimeter created by the elastic band. For more information, check this Wikipedia article out.
The purpose of this application is to provide a visualization of the execution of a few popular convex hull algorithms. Click here for the code.
Namely:
| Enter number of vertices: |
| Algorithm: |
|
Execution Speed:
|