1,447 research outputs found
On Greedily Packing Anchored Rectangles
Consider a set P of points in the unit square U, one of them being the
origin. For each point p in P you may draw a rectangle in U with its lower-left
corner in p. What is the maximum area such rectangles can cover without
overlapping each other? Freedman [1969] posed this problem in 1969, asking
whether one can always cover at least 50% of U. Over 40 years later, Dumitrescu
and T\'oth [2011] achieved the first constant coverage of 9.1%; since then, no
significant progress was made. While 9.1% might seem low, the authors could not
find any instance where their algorithm covers less than 50%, nourishing the
hope to eventually prove a 50% bound. While we indeed significantly raise the
algorithm's coverage to 39%, we extinguish the hope of reaching 50% by giving
points for which the coverage is below 43.3%. Our analysis studies the
algorithm's average and worst-case density of so-called tiles, which represent
the area where a given point can freely choose its maximum-area rectangle. Our
approachis comparatively general and may potentially help in analyzing related
algorithms
Anchored Rectangle and Square Packings
For points p_1,...,p_n in the unit square [0,1]^2, an anchored rectangle packing consists of interior-disjoint axis-aligned empty rectangles r_1,...,r_n in [0,1]^2 such that point p_i is a corner of the rectangle r_i (that is, r_i is anchored at p_i) for i=1,...,n. We show that for every set of n points in [0,1]^2, there is an anchored rectangle packing of area at least 7/12-O(1/n), and for every n, there are point sets for which the area of every anchored rectangle packing is at most 2/3. The maximum area of an anchored square packing is always at least 5/32 and sometimes at most 7/27.
The above constructive lower bounds immediately yield constant-factor approximations, of 7/12 -epsilon for rectangles and 5/32 for squares, for computing anchored packings of maximum area in O(n log n) time. We prove that a simple greedy strategy achieves a 9/47-approximation for anchored square packings, and 1/3 for lower-left anchored square packings. Reductions to maximum weight independent set (MWIS) yield a QPTAS and a PTAS for anchored rectangle and square packings in n^{O(1/epsilon)} and exp(poly(log (n/epsilon))) time, respectively
The Maximum Exposure Problem
Given a set of points P and axis-aligned rectangles R in the plane, a point p in P is called exposed if it lies outside all rectangles in R. In the max-exposure problem, given an integer parameter k, we want to delete k rectangles from R so as to maximize the number of exposed points. We show that the problem is NP-hard and assuming plausible complexity conjectures is also hard to approximate even when rectangles in R are translates of two fixed rectangles. However, if R only consists of translates of a single rectangle, we present a polynomial-time approximation scheme. For general rectangle range space, we present a simple O(k) bicriteria approximation algorithm; that is by deleting O(k^2) rectangles, we can expose at least Omega(1/k) of the optimal number of points
Maximum Area Axis-Aligned Square Packings
Given a point set S={s_1,...s_n} in the unit square U=[0,1]^2, an anchored square packing is a set of n interior-disjoint empty squares in U such that s_i is a corner of the ith square. The reach R(S) of S is the set of points that may be covered by such a packing, that is, the union of all empty squares anchored at points in S.
It is shown that area(R(S))>= 1/2 for every finite set S subset U, and this bound is the best possible. The region R(S) can be computed in O(n log n) time. Finally, we prove that finding a maximum area anchored square packing is NP-complete. This is the first hardness proof for a geometric packing problem where the size of geometric objects in the packing is unrestricted
- …