Approximating a planar convex set using a sparse grid

We show how to construct a set S of O(1/??1.5) points such that for any convex set C contained in the unit square, the convex hull of the points in S that are contained in C has area at least |C|?????. We present two algorithmic applications, for geometric shape matching and area approximation