44 search results - page 5 / 9 » Optimal Cover of Points by Disks in a Simple Polygon |
156
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
143
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
178
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
144
click to vote
DCOSS
2009
Springer
16 years 18 days ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
174
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...