Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem

@misc{deng2026closed,
  title = {{Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem}},
  author = {Zhipeng Deng},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32931},
  eprint = {2609.32931},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32931},
  note = {CC BY-NC-ND 4.0},
}

TY  - UNPB
TI  - Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem
AU  - Zhipeng Deng
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32931
UR  - https://arxiv.org/abs/2609.32931
AB  - Lebesgue's universal covering problem asks for the minimum area convex planar region capable of containing a congruent copy of every planar set of diameter at most one. In this paper, we develop an exact dual formulation of this problem through a minimum diameter analogue of Bellman's lost-in-a-forest problem. For a compact convex forest F, we define the critical escape diameter D(F) as the minimum diameter of a closed path whose trace cannot be placed, under any rigid motion, entirely in the interior of F. We prove attainment of this minimum and establish a diameter cover/escape duality showing that the normalized body D(F)^−1F is a Lebesgue universal cover. Consequently, the Lebesgue universal covering constant admits the exact representation ℒ=inf_FArea(F)/D(F)^2, where the infimum ranges over compact convex planar bodies with nonempty interior. By reversing the rigid motion, we further characterize escape as intersection of a fixed path with every oppositely transformed boundary of F, and derive equivalent continuous curve, convex body, and support function optimization formulations. To make the infinite dimensional problem computationally tractable while retaining rigorous control of approximation error, we discretize the compact configuration space by an η_m-net and formulate the resulting problem as a minimum diameter traveling salesman problem with neighborhoods; for polygonal forests, an exact mixed-integer second-order cone formulation is obtained. We prove the quantitative certification, which yields convergent, rigorously certified universal cover bounds. The framework replaces finite tests of prescribed constant width shapes by a unified optimization over the full configuration space and extends naturally to other congruent and translative universal cover problems.
ER  -