349 search results - page 1 / 70 » Covering a Set of Points with a Minimum Number of Lines |
116
Voted
CIAC
2006
Springer
15 years 2 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
100
Voted
SIAMDM
2008
14 years 10 months ago
2008
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
81
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
78
Voted
JUCS
2010
14 years 8 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
85
Voted
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...