paper

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

arXiv:2011.10463

Abstract

Fix a compact and . A minimizer of the maximal distance functional is a connected set of the minimal length, such that \[ max_{y \in M} dist(y,Σ) \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 , with the minimal radius of curvature greater than (it implies that is smooth). The first part is devoted to statements on structure of : we show that the closure of an arbitrary connected component of 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 are contained in -neighborhoods of different points , . We write conditions on the behavior of in the neighborhoods of and under the assumption by moving along .

10 pages, 7 figures