24 search results - page 2 / 5 » Covering a Set of Points in a Plane Using Two Parallel Recta... |
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
CCCG
2008
13 years 6 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
CCCG
1993
13 years 6 months ago
1993
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
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...