What are efficient methods (polytime) to compute an approximation of the convex hull in high dimension (say, $30000$) for a given set of points?

**Edit:**
I am looking for an algorithm for getting t**he hyperplanes that define the convex hull**, **not** the extreme points that are the vertices of the convex hull.