Sets associated with the farthest point problem
Let \(S\) be a convex compact set in \(E^ 2\). For each cardinal number \(n\), let \(S_ n = \{x \in E^ 2: x\) has exactly \(n\) farthest points in \(S\)\} and \(T_ n = \bigcup_{k \geq n} S_ k\). The authors prove that \(T_ 3\) is countable and that \(T_ 2\) is contractible to a point. Let \(\forall x \in E^ 2\), \(d(x) = \max \{\| s - x\|: s \in S\}\) denote the distance from \(x\) to any of its farthest points of \(S\). Let \(L_ r = \{x \in E^ 2: d(x) = r\}\), \(r \geq r_ s\) denote the level curve where \(r_ s\) is the circumradius of \(S\). Let \(F(x) = \{\sigma \in S: \| \sigma - x\| = d(x)\}\) be the set of farthest points in \(S\) from \(x\). The authors give several properties relating the level curves and the boundary of \(S\). Among other results a) they prove that if \(L_ r \subset S_ 1\) for some \(r > r_ s\), then \(\partial S = \bigcup_{x \in L_ r} F(x)\); b) they give a lower bound \(\rho^*\) such that for all \(r > \rho^* L_ r \subset S_ 1\); c) they prove that if \(S\) is \(C^ 3 \partial S\) and \(L_ r\) have the same evolute. The authors suggest that analogous results may hold not only in \(E^ 2\) but in more general normed linear spaces.
- Distances to the two and three furthest points
- The farthest point distance function
- scientific article; zbMATH DE number 4686 (Why is no real title available?)
- scientific article; zbMATH DE number 2237540 (Why is no real title available?)
- Maximum distance between a point and a compact set in the plane. I
- Sharper approximation of extreme points by far points
This page was built for publication: Sets associated with the farthest point problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337107)
