Inverse maximal and average distance minimizer problems

MaRDI QIDQ6419493zbMATH OpenFDO

Authors Mikhail Basok, Danila Cherkashin, Yana Teplitskaya

Publication date 4 December 2022

Abstract: Consider a compact $Msubsetmathbb{R}^d$ and $r>0$. A maximal distance minimizer problem is to find a connected compact set $Sigma$ of the minimal length, such that [ max_{y in M} dist (y, Sigma) leq r. ] The inverse problem is to determine whether a given compact connected set $Sigma$ is a minimizer for some compact $M$ and some positive $r$. Let a Steiner tree $St$ with $n$ terminals be unique for its terminal vertices. The first result of the paper is that $St$ is a minimizer for a set $M$ of $n$ points and a small enough positive $r$. It is known that in the planar case a general Steiner tree (on a finite number of terminals) is unique. It is worth noting that a Steiner tree on $n$ terminal vertices can be not a minimizer for any $n$ point set $M$ starting with $n=4$; the simplest such example is a Steiner tree for the vertices of a square. Recall that a planar maximal distance minimizer is a finite union of simple curves. The second result is an example of a minimizer with an infinite number of corner points (points with two tangent rays which do not belong to the same line), which means that this minimizer can not be represented as a finite union of smooth curves. We also show that every injective $C^{1,1}$-curve $Sigma$ is a minimizer for a small enough $r>0$ and $M=overline{B}_r(Sigma)$ (this follows from the proof of analogues result by Tilli on average distance minimizers).

This page was built for publication: Inverse maximal and average distance minimizer problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419493)