Maximal distance minimizers for a rectangle
Abstract
A maximal distance minimizer for a given compact set M ⊂ R2 and some given r > 0 is a set having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets ⊂ R2 satisfying the inequality \[ y∈ M dist (y, ) ≤ r. \] This paper deals with the set of maximal distance minimizers for a rectangle M and small enough r.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.