Convexity, critical points, and connectivity radius
From MaRDI portal
Publication:5212433
Abstract: We study the level sets of the distance function from a boundary point of a convex set in Euclidean space. We provide a lower bound for the range of connectivity of the level sets, in terms of the critical points of the distance function in the sense of Grove-Shiohama-Gromov-Cheeger.
Recommendations
- scientific article; zbMATH DE number 737509
- SMALLNESS OF THE SET OF CRITICAL VALUES OF DISTANCE FUNCTIONS IN TWO‐DIMENSIONAL EUCLIDEAN AND RIEMANNIAN SPACES
- On the topology of the effective subsets of level sets
- Convexity of level sets and a two-point function
- Critical values and level sets of distance functions in Riemannian, Alexandrov and Minkowski spaces
Cites work
Cited in
(2)
This page was built for publication: Convexity, critical points, and connectivity radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212433)