Delaunay Triangulation and 3D Convex Hull

This project demonstrates the convex hull algorithm but on 3d point clouds. This program will visualize the 3d hull and also will work for any random set of 3d points in a point cloud.

To extend this, I also implemented a Delaunay Triangulation by finding the dual of the convex hull. An image can be found below and the repository is on my git hub.