Minimum-width rectangular annulus

In this paper, we identify a minimum width rectangular annulus that encloses a given set of n points in a plane. We propose an O(n^2logn) time and O(n) space algorithm for this problem. To the best of our knowledge this is the first sub-cubic algorithm for a rectangular annulus for arbitrary orientation.