Computing a minimum-width square or rectangular annulus with outliers

Abstract

A square or rectangular annulus is the closed region between a square or rectangle and its offset. In this paper, we address the problem of computing a minimum-width square or rectangular annulus that contains at least n−k points out of n given points in the plane. The k excluded points are considered as outliers of the n input points. We present several first algorithms to the problem.