Computing a minimum-width square annulus in arbitrary orientation

In this paper, we address the problem of computing a minimum-width square annulus in arbitrary orientation that encloses a given set of n points in the plane. A square annulus is the region between two concentric squares. We present an O(n3log⁡n)-time algorithm that finds such a square annulus over all orientations.