• Covering and piercing disks wi...

Treffer: Covering and piercing disks with two centers

Title:
Covering and piercing disks with two centers
Authors:
Ahn, Hee-Kap1 heekap@postech.ac.kr, Kim, Sang-Sub1 helmet1981@postech.ac.kr, Knauer, Christian2 christian.knauer@uni-bayreuth.de, Schlipf, Lena3 schlipf@mi.fu-berlin.de, Shin, Chan-Su4 cssin@hufs.ac.kr, Vigneron, Antoine5 antoine.vigneron@kaust.edu.sa
Source:
Computational Geometry. Apr2013, Vol. 46 Issue 3, p253-262. 10p.
Subject Terms:
*COMBINATORIAL packing & covering, *COMBINATORIAL designs & configurations, *APPROXIMATION theory, *ALGORITHMS, *GEOMETRIC congruences, *INTERSECTION theory
Database:
Academic Search Index

Weitere Informationen

Abstract: We give exact and approximation algorithms for two-center problems when the input is a set of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in intersects one of these two disks. Then we study the problem of covering the set by two smallest congruent disks. [Copyright &y& Elsevier]