Algorithms for optimal outlier removal

We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter, having minimum area (perimeter) bounding box, having minimum area (perimeter) convex hull. For constant values of c  , all our algorithms run in O(nlogn)O(nlogn) time.