English

On minimizers of the maximal distance functional for a planar convex closed smooth curve

Combinatorics 2020-11-23 v1

Abstract

Fix a compact MR2M \subset \mathbb{R}^2 and r>0r>0. A minimizer of the maximal distance functional is a connected set Σ\Sigma of the minimal length, such that maxyMdist(y,Σ)r. max_{y \in M} dist(y,\Sigma) \leq r. The problem of finding maximal distance minimizers is connected to the Steiner tree problem. In this paper we consider the case of a convex closed curve MM, with the minimal radius of curvature greater than rr (it implies that MM is smooth). The first part is devoted to statements on structure of Σ\Sigma: we show that the closure of an arbitrary connected component of Br(M)ΣB_r(M) \cap \Sigma is a local Steiner tree which connects no more than five vertices. In the second part we "derive in the picture". Assume that the left and right neighborhoods of yMy \in M are contained in rr-neighborhoods of different points x1x_1, x2Σx_2 \in \Sigma. We write conditions on the behavior of Σ\Sigma in the neighborhoods of x1x_1 and x2x_2 under the assumption by moving yy along MM.

Keywords

Cite

@article{arxiv.2011.10463,
  title  = {On minimizers of the maximal distance functional for a planar convex closed smooth curve},
  author = {D. D. Cherkashin and A. S. Gordeev and G. A. Strukov and Y. I. Teplitskaya},
  journal= {arXiv preprint arXiv:2011.10463},
  year   = {2020}
}

Comments

10 pages, 7 figures