Computing a minimum-width square annulus in arbitrary orientation (Q1705772)

In this paper the problem of computing a minimum-width square annulus in arbitrary orientation that encloses a given set of \(n\) points in the plane is addressed. A square annulus is the region between two concetric squares. In this paper an algorithm that finds such a square annulus over all orientations is presented. This algorithm works in \(O(n^{3} \log n)\) time.