Covering and Piercing Disks with Two Centers

Details Covering and Piercing Disks with Two Centers Covering and Piercing Disks with Two Centers

2012-01-05

arxiv.org/abs/1201.1198v1

Computer Science

Computational Geometry

14 pages, 3 figures, the results appeared in the proceedings of ISAAC'11

Scientific paper

We give exact and approximation algorithms for two-center problems when the
input is a set $\mathcal{D}$ of disks in the plane. We first study the problem
of finding two smallest congruent disks such that each disk in $\mathcal{D}$
intersects one of these two disks. Then we study the problem of covering the
set $\mathcal{D}$ by two smallest congruent disks.

Affiliated with

Also associated with

No associations

Rating

Covering and Piercing Disks with Two Centers 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 Covering and Piercing Disks with Two Centers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering and Piercing Disks with Two Centers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-610146