Convex hull

So this library is titled `MiniQHull`, yet it does not have an obvious method for convex hull computation. Converting a convex hull method to an unconstrained Delaunay triangulation algorithm is quite simple; is there a way to, in the other direction, use this library's Delaunay triangulation method to compute convex hull, or does this need to export a convex hull function from the C library?