Covering and piercing disks with two centers

Authors:
Hee-Kap Ahn;Sang-Sub Kim;Christian Knauer;Lena Schlipf;Chan-Su Shin;Antoine Vigneron
Affiliations:
Department of Computer Science and Engineering, POSTECH, Pohang, Republic of Korea;Department of Computer Science and Engineering, POSTECH, Pohang, Republic of Korea;Institute of Computer Science, Universität Bayreuth, 95440 Bayreuth, Germany;Institute of Computer Science, Freie Universität Berlin, Germany;Department of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, Republic of Korea;Geometric Modeling and Scientific Visualization Center, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia
Venue:
Computational Geometry: Theory and Applications
Year:
2013

Citing 12
Cited 0

On the ball spanned by balls

Discrete & Computational Geometry
Applications of parametric searching in geometric optimization

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Las Vegas algorithms for linear and integer programming when the dimension is small

Journal of the ACM (JACM)
Deterministic algorithms for 2-D convex programming and 3-D Online linear programming

Journal of Algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Faster construction of planar two-centers

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
More planar two-center algorithms

Computational Geometry: Theory and Applications
A Combinatorial Bound for Linear Programming and Related Problems

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Two-Center Problems for a Convex Polygon (Extended Abstract)

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The smallest enclosing ball of balls: combinatorial structure and algorithms

Proceedings of the nineteenth annual symposium on Computational geometry
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Largest bounding box, smallest diameter, and related problems on imprecise points

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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