20 search results - page 1 / 4 » Rectangle Covers Revisited Computationally |
WEA
2005
Springer
13 years 11 months ago
2005
Springer
ICCTA
2007
IEEE
13 years 12 months ago
2007
IEEE
We 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 m...
COMGEO
2011
ACM
13 years 18 days ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
TALG
2008
13 years 5 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...