44 search results - page 2 / 9 » Optimal Cover of Points by Disks in a Simple Polygon |
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 ...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
WADS
2009
Springer
13 years 10 months ago
2009
Springer
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...
COCOON
2001
Springer
13 years 10 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on the geometry information of sensors and under the assumpt...