196 search results - page 2 / 40 » On Isolating Points Using Disks |
ISAAC
2009
Springer
13 years 11 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 ...
COMGEO
2008
ACM
13 years 4 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 ...
MVA
2007
13 years 6 months ago
2007
Localization and segmentation of Optic Disk (OD) is an important prerequisite for automatic detection of Diabetic Retinopathy (DR) from digital retinal fundus images. Considerable...
COMPGEOM
2006
ACM
13 years 10 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...
ICIP
2003
IEEE
14 years 6 months ago
2003
IEEE
Random access is a desirable feature in many video communication systems. Intra pictures have been conventionally used as random access points, but correct picture content can als...