Abstract.
For 0<x<1 denote by f(x) the length of the side of the largest open square Q that can be covered by the sequence {Q n } ∈ fty n=0 of closed squares, where Q n has side of length x n , and is placed so that its sides are parallel to those of Q. We obtain some information concerning f(x) and discuss some related questions.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received February 23, 1999, and in revised form October 13, 1999.
Rights and permissions
About this article
Cite this article
Abbott, H., Katchalski, M. Covering Squares with Squares . Discrete Comput Geom 24, 151–170 (2000). https://doi.org/10.1007/s004540010023
Issue Date:
DOI: https://doi.org/10.1007/s004540010023