44 search results - page 1 / 9 » Optimal Cover of Points by Disks in a Simple Polygon |
ESA
2010
Springer
13 years 6 months ago
2010
Springer
CCCG
2010
13 years 6 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
JCO
2010
13 years 3 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...
PAAPP
1998
13 years 4 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
GC
2007
Springer
13 years 4 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...