Lower bound for convex hull area and universal cover problems
From MaRDI portal
Publication:3459368
Abstract: We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three objects with minimal convex hull area. Consequently, we improve a lower bound for Moser's worm problem from 0.2194 to 0.227498.
Recommendations
Cites work
- A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM
- An improved upper bound for Leo Moser's worm problem
- Convex Regions Which Cover Arcs of Constant Length
- Covers for closed curves of length two
- Der zentralsymmetrische Kern und die zentralsymmetrische Hülle von konvexen Körpern
- Lost in a forest
- Minimal Covers for Closed Curves
- Problems, problems, problems
Cited in
(8)- Generalized breadths, circular Cantor sets, and the least area UCC
- Wetzel's sector covers unit arcs
- A convex cover for closed unit curves has area at least 0.1
- Viterbo's conjecture as a worm problem
- A convex cover for closed unit curves has area at least 0.0975
- An improved upper bound for worm problem
- A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM
- Recent advances in the worm problem
This page was built for publication: Lower bound for convex hull area and universal cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459368)