Minimum-width annulus with outliers: Circular, square, and rectangular cases

초록

We study the problem of computing a minimum-width annulus with outliers. Specifically, given a set of n points in the plane and an integer k with 1 <= k <= n, the problem asks to find a minimum-width annulus that contains at least n - k input points. The k excluded points are considered as outliers of the input points. In this paper, we are interested in particular in annuli of three different shapes: circular, square, and rectangular annuli. For the three cases, we present first and improved algorithms to the problem.