Optimizing convex hull algorithm

To optimize the current convex hull algorithm to improve robustness and efficiency. The current implementation (quickhull) has cases which it cannot handle, and will resort to deleting those problematic points. The aim is to try and look at alternative algorithms or improve on the existing algorithm to make it more stable, and improving efficiency by parallelization. The ideal goal is to implement an efficient algorithm with less maintenance.