An improved algorithm and implementation for three-dimensional convex hull

A novel and efficient approach for three-dimensional convex hull was presented in the paper, comparing with the Quick Hull method, the quadratic extremal-point was employed to construct the convex hull in the method, combined with "conflict map" (Conflict-Graph) of this bipartite graph structure to updated the topological relations between the points outside the convex hull and the current convex hull. This algorithm's time complexity is O (nlogr), the experimental results shows that the algorithm is more efficient when compared with the Quick Hull method (the average execution time-consuming reduced by 20%)