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

Abstract

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

0

Discussion (0)

Sign in to join the discussion.

Loading comments…