Log In Sign Up

Reducing Moser's Square Packing Problem to a Bounded Number of Squares

by   Meike Neuwohner, et al.

The problem widely known as Moser's Square Packing Problem asks for the smallest area A such that for any set S of squares of total area 1, there exists a rectangle R of area A into which the squares in S permit an internally-disjoint, axis-parallel packing. It was formulated by Moser in 1966 and remains unsolved so far. The best known lower bound of 2+√(3)/3≤ A is due to Novotný and has been shown to be sufficient for up to 11 squares by Platz, while Hougardy and Ilhan have established that A < 1.37. In this paper, we reduce Moser's Square Packing Problem to a problem on a finite set of squares in the following sense: We show how to compute a natural number N such that it is enough to determine the value of A for sets containing at most N squares with total area 1.


page 1

page 2

page 3

page 4


Maximum Area Axis-Aligned Square Packings

Given a point set S={s_1,... , s_n} in the unit square U=[0,1]^2, an anc...

Packing, Hitting, and Coloring Squares

Given a family of squares in the plane, their packing problem asks for t...

Packing Boundary-Anchored Rectangles and Squares

Consider a set P of n points on the boundary of an axis-aligned square Q...

Packing Squares into a Disk with Optimal Worst-Case Density

We provide a tight result for a fundamental problem arising from packing...

Optimal Rectangle Packing: An Absolute Placement Approach

We consider the problem of finding all enclosing rectangles of minimum a...

A Reallocation Algorithm for Online Split Packing of Circles

The Split Packing algorithm is an offline algorithm that packs a set of ...

The Packing Chromatic Number of the Infinite Square Grid is 15

A packing k-coloring is a natural variation on the standard notion of gr...