TY - JOUR

T1 - Discrete rectilinear 2-center problems

AU - Katz, Matthew J.

AU - Kedem, Klara

AU - Segal, Michael

N1 - Funding Information:
I A preliminary version of this paper appeared in the Proceedings of The Scandinavian Workshop on Algorithm Theory (SWAT’98, Sweden), Lecture Notes in Computer Science, Vol. 1432, Springer, pp. 95–106. ∗Corresponding author. E-mail address: [email protected] (K. Kedem). 1Supported by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanities. 2Supported by the U.S.–Israeli Binational Science Foundation, and by the Mary Upson Award, College of Engineering, Cornell University.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0346385885&partnerID=8YFLogxK

U2 - 10.1016/S0925-7721(99)00052-8

DO - 10.1016/S0925-7721(99)00052-8

M3 - Article

AN - SCOPUS:0346385885

SN - 0925-7721

VL - 15

SP - 203

EP - 214

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

IS - 4

ER -