1. CMB 2009 (vol 52 pp. 424)
|Covering Discs in Minkowski Planes |
We investigate the following version of the circle covering problem in strictly convex (normed or) Minkowski planes: to cover a circle of largest possible diameter by $k$ unit circles. In particular, we study the cases $k=3$, $k=4$, and $k=7$. For $k=3$ and $k=4$, the diameters under consideration are described in terms of side-lengths and circumradii of certain inscribed regular triangles or quadrangles. This yields also simple explanations of geometric meanings that the corresponding homothety ratios have. It turns out that basic notions from Minkowski geometry play an essential role in our proofs, namely Minkowskian bisectors, $d$-segments, and the monotonicity lemma.
Keywords:affine regular polygon, bisector, circle covering problem, circumradius, $d$-segment, Minkowski plane, (strictly convex) normed plane
Categories:46B20, 52A21, 52C15