Packing anchored rectangles
Combinatorics
2012-07-31 v2 Computational Geometry
Abstract
Let be a set of points in the unit square , one of which is the origin. We construct pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in , 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.
Cite
@article{arxiv.1107.5102,
title = {Packing anchored rectangles},
author = {Adrian Dumitrescu and Csaba D. Tóth},
journal= {arXiv preprint arXiv:1107.5102},
year = {2012}
}
Comments
17 pages, 7 figures; updated references