Find in Library

Given a compact E⊂Rⁿ and s>0, the maximum distance problem seeks a compact and connected subset of Rⁿ of smallest one dimensional Hausdorff measure whose s-neighborhood covers E. For E⊂R², we prove that minimizing over minimum spanning trees that connect the centers of balls of radius s, which cover E, solves the maximum distance problem. The main difficulty in proving this result is overcome by the proof of a key lemma which states that one is able to cover the s-neighborhood of a Lipschitz curve Γ in R² with a finite number of balls of radius s, and connect their centers with another Lipschitz curve Γ_∗, where H1 (Γ_∗) is arbitrarily close to H¹(Γ). We also present an open source package for computational exploration of the maximum distance problem using minimum spanning trees, available at github.com/mtdaydream/MDP_MST.