Add to ORKGWe consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is minimized. We give a simple algorithm that solves the problem in O(n3) time using O(n2) space. Without altering the complexity, the algorithm can be modified to solve another optimization problem, namely, minimize the sum of the areas of two arbitrarily oriented parallel rectangles covering a given set of points in a plane
The minimum-area parallelogram annulus problem is studied, in which one wants to compute a parallelo...
AbstractIn this paper we study the following problem: Given sets R and B of r red and b blue points ...
Two new algorithms are described for the following problems: given a set of N points in the plane d...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the small...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the small...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the sma...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the smallest...
Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the sma...
\u3cp\u3eLet P be a set of n points in the plane. We show how to find, for a given integer k >0, ...
For a set of n points in the plane, we consider the axis-aligned (p; k)-Box COVERING problem: Find p...
AbstractWe study the following problem: Given a set of red points and a set of blue points on the pl...
In this paper, we study the problem of computing a minimum-width double-strip or parallelogram annul...
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p...
For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p ...
The minimum-area parallelogram annulus problem is studied, in which one wants to compute a parallelo...
AbstractIn this paper we study the following problem: Given sets R and B of r red and b blue points ...
Two new algorithms are described for the following problems: given a set of N points in the plane d...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the small...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the small...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the sma...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the smallest...
Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the sma...
\u3cp\u3eLet P be a set of n points in the plane. We show how to find, for a given integer k >0, ...
For a set of n points in the plane, we consider the axis-aligned (p; k)-Box COVERING problem: Find p...
AbstractWe study the following problem: Given a set of red points and a set of blue points on the pl...
In this paper, we study the problem of computing a minimum-width double-strip or parallelogram annul...
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p...
For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p ...
The minimum-area parallelogram annulus problem is studied, in which one wants to compute a parallelo...
AbstractIn this paper we study the following problem: Given sets R and B of r red and b blue points ...
Two new algorithms are described for the following problems: given a set of N points in the plane d...