Covering a Point Set by Two Disjoint Rectangles
- Cite this paper as:
- Ahn HK., Bae S.W. (2008) Covering a Point Set by Two Disjoint Rectangles. In: Hong SH., Nagamochi H., Fukunaga T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pair of disjoint rectangles such that their union contains S and the area of the larger rectangle is minimized. In this paper we consider two variants of this optimization problem: (1) the rectangles are free to rotate but must remain parallel to each other, and (2) one rectangle is axis-parallel but the other rectangle is allowed to have an arbitrary orientation. For both of the problems, we present O(n2logn)-time algorithms using O(n) space.
Unable to display preview. Download preview PDF.