CORR
2011
Springer
13 years 8 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
COMGEO
2008
ACM
14 years 1 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 ...
COMPGEOM
2008
ACM
14 years 3 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
COMPGEOM
2008
ACM
14 years 3 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
COCOON
2006
Springer
14 years 5 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
WADS
1997
Springer
14 years 6 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
STOC
1996
ACM
14 years 6 months ago
1996
ACM
If disks are moved so that each center
SODA
2010
ACM
14 years 11 months ago
2010
ACM
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...