@inproceedings{b79db75105a6416ea8e87112d5445846,

title = "Constrained square-center problems",

abstract = "Given a set P of n points in the plane, we seek two squares whose 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.",

author = "Katz, {Matthew J.} and Klara Kedem and Michael Segal",

note = "Publisher Copyright: {\textcopyright} 1998, Springer-Verlag. All rights reserved.; 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998 ; Conference date: 08-07-1998 Through 10-07-1998",

year = "1998",

month = jan,

day = "1",

doi = "10.1007/BFb0054358",

language = "English",

isbn = "3540646825",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "95--106",

editor = "Stefan Arnborg and Lars Ivansson",

booktitle = "Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings",

address = "Germany",

}