Computer Science – Computational Geometry
Scientific paper
2011-04-26
Computer Science
Computational Geometry
9 pages, 4 figures
Scientific paper
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 no path between any pair of these points that is not intercepted by some disk. We try to achieve this separation using a minimum number of a given set of unit disks. We show that a constant factor approximation to this problem can be found in polynomial time using a greedy algorithm. To the best of our knowledge we are the first to study this optimization problem.
Gibson Matt
Kanade Gaurav
Varadarajan Kasturi
No associations
LandOfFree
On Isolating Points Using Disks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Isolating Points Using Disks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Isolating Points Using Disks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-474704