Construct the convex hull of any given set of 3D points using the Incremental Algorithm.
hull.py consists of the incremental algorithm implementation in python. Detailed algorithm can be referred from the book "COMPUTATIONAL GEOMETRY IN C - JOSEPH O'ROURKE" or from here. It's time complexity is
To run it on a custom dataset, modify data.txt with custom set of vertices in euclidean space in the format x y z in each line. Code prints the list of faces of the hull, plots the hull and also outputs an stl file
