Before revision: We study the problem of minimum enclosing parallelogram with outliers, which asks to find, for a given set of n planar points, a parallelogram with minimum area that encloses at least (n-t) points , where the uncovered points are regarded as outliers.
After revision: We study the problem of minimum enclosing parallelogram with outliers, which asks to find, for a given set of n planar points, a rectangle with minimum area that encloses at least (n-t) points , where the uncovered points are regarded as outliers.