Given a set P of n points in the plane, we seek two squares such that their center points belong to P, their union contains P, and the area of the larger square is minimal. We present efficient algorithms for three variants of this problem: in the first the squares are axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free to rotate independently. © 2000 Elsevier Science B.V. All rights reserved.
Katz, M. J., Kedem, K., & Segal, M. (2000). Discrete rectilinear 2-center problems. Computational Geometry: Theory and Applications, 15(4), 203–214. https://doi.org/10.1016/S0925-7721(99)00052-8