349 search results - page 5 / 70 » Covering a Set of Points with a Minimum Number of Lines |
AAIM
2007
Springer
14 years 2 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
COMGEO
2008
ACM
13 years 8 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 ...
COCOON
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
JCO
2010
13 years 6 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...