QHULL is an IDL routine to apply Quick Hull algorithm for various applications.
Bibliography: “The Quickhull Algorithm for Convex Hulls,” ACM Transactions on Mathematical Software, Vol. 22, No 4, December 1996, Pages 469-483, Barber, Dobkin and Huhdanpaa
One application consists in building the largest convex polygon around a set of random points. The example below is showing how to use QHULL in such context.