pith. machine review for the scientific record. sign in

arxiv: 1107.5102 · v2 · submitted 2011-07-26 · 🧮 math.CO · cs.CG

Recognition: unknown

Packing anchored rectangles

Authors on Pith no claims yet
classification 🧮 math.CO cs.CG
keywords rectanglesareacoverjointlyleastpackinganchoredaxis-aligned
0
0 comments X
read the original abstract

Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the rectangles jointly cover at least a positive constant area (about 0.09). This is a first step towards the solution of a longstanding conjecture that the rectangles in such a packing can jointly cover an area of at least 1/2.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.